MAXIMALITY OF LOGIC WITHOUT IDENTITY

From MaRDI portal
Publication:6123583



Abstract: Lindstr"om theorem obviously fails as a characterization of mathcalLomegaomega−, first-order logic without identity. In this note we provide a fix: we show that mathcalLomegaomega− 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.





Cites work









This page was built for publication: MAXIMALITY OF LOGIC WITHOUT IDENTITY

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6123583)