INFINITARY PROPOSITIONAL RELEVANT LANGUAGES WITH ABSURDITY

From MaRDI portal
Publication:4600823



Abstract: Analogues of Scott's isomorphism theorem, Karp's theorem as well as results on lack of compactness and strong completeness are established for infinitary propositional relevant logics. An "interpolation theorem" (of a particular sort introduced by Barwise and van Benthem) for the infinitary quantificational boolean logic Linftyomega holds. This yields a preservation result characterizing the expressive power of infinitary relevant languages with absurdity using the model-theoretic relation of relevant directed bisimulation as well as a Beth definability property.




Cites work









This page was built for publication: INFINITARY PROPOSITIONAL RELEVANT LANGUAGES WITH ABSURDITY

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