Taming logic

Journal of Logic, Language and Information 4 (3):207-226 (1995)
  Copy   BIBTEX


In this paper, we introduce a general technology, calledtaming, for finding well-behaved versions of well-investigated logics. Further, we state completeness, decidability, definability and interpolation results for a multimodal logic, calledarrow logic, with additional operators such as thedifference operator, andgraded modalities. Finally, we give a completeness proof for a strong version of arrow logic.



    Upload a copy of this work     Papers currently archived: 91,271

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Elementary definability and completeness in general and positive modal logic.Ernst Zimmermann - 2003 - Journal of Logic, Language and Information 12 (1):99-117.
Decidable and undecidable logics with a binary modality.ágnes Kurucz, István Németi, Ildikó Sain & András Simon - 1995 - Journal of Logic, Language and Information 4 (3):191-206.
The Semantics and Proof Theory of Linear Logic.Arnon Avron - 1988 - Theoretical Computer Science 57 (2):161-184.
On extensions of intermediate logics by strong negation.Marcus Kracht - 1998 - Journal of Philosophical Logic 27 (1):49-73.
Propositional q-logic.Stefan Wölfl - 2002 - Journal of Philosophical Logic 31 (5):387-414.
T × W Completeness.Franz Kutschervona - 1997 - Journal of Philosophical Logic 26 (3):241-250.
Remarks on Gregory's “actually” operator.Patrick Blackburn & Maarten Marx - 2002 - Journal of Philosophical Logic 31 (3):281-288.


Added to PP

35 (#441,839)

6 months
10 (#250,275)

Historical graph of downloads
How can I increase my downloads?