Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-18T09:15:44.393Z Has data issue: false hasContentIssue false

INFINITARY PROPOSITIONAL RELEVANT LANGUAGES WITH ABSURDITY

Published online by Cambridge University Press:  01 August 2017

GUILLERMO BADIA*
Affiliation:
Department of Knowledge-Based Mathematical Systems Johannes Kepler Universität Linz
*
*DEPARTMENT OF KNOWLEDGE-BASED MATHEMATICAL SYSTEMS JOHANNES KEPLER UNIVERSITÄT LINZ LINZ, AUSTRIA E-mail: guillebadia89@gmail.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2017