Maximality of logic without identity
Guillermo Badia, Xavier Caicedo, Carles Noguera

TL;DR
This paper establishes that the logic alL_{\u2208 }^- is maximal among logics satisfying certain properties like the isomorphism property, Lwenheim--Skolem, and compactness, with a focus on identity-free languages.
Contribution
It provides a corrected characterization of alL_{\u2208 }^- as maximal under specific model-theoretic properties, adapting Lindstrm's theorem for languages without identity.
Findings
alL_{\u2208 }^- is maximal among logics with the isomorphism property, Lwenheim--Skolem, and compactness.
Compactness can be replaced by recursive enumerability of validity under certain conditions.
A strong upwards Lwenheim--Skolem theorem is used, which is not available with identity.
Abstract
Lindstr\"om theorem obviously fails as a characterization of , first-order logic without identity. In this note we provide a fix: we show that is \emph{maximal} among abstract logics satisfying a weak form of the isomorphism property (suitable for identity-free languages and studied in \cite{Casa}), the L\"owenheim--Skolem property, and compactness. Furthermore, we show that compactness can be replaced by being recursively enumerable for validity under certain conditions. In the proofs we use a form of strong upwards L\"owenheim--Skolem theorem not available in the framework with identity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
