2018/09/21 by Guillermo Badía, Badia, Guillermo
Computer Science · #Advanced Algebra and Logic #FOS: Mathematics #Logic (math.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems
paper · pdf · doi:10.48550/arxiv.1809.08153
openalex publication_date 2018/09/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 L∞ ω 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.