- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Taming logic
Journal of Logic, Language and Information 4 (3):207-226 (1995)
Abstract
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.My notes
Similar books and articles
Remarks on Gregory's “actually” operator.Patrick Blackburn & Maarten Marx - 2002 - Journal of Philosophical Logic 31 (3):281-288.
Remarks on Gregory's “Actually” Operator.Blackburn Patrick & Marx Maarten - 2002 - Journal of Philosophical Logic 31 (3):281-288.
On combinations of propositional dynamic logic and doxastic modal logics.Renate A. Schmidt & Dmitry Tishkovsky - 2008 - Journal of Logic, Language and Information 17 (1):109-129.
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.
Some Connections between Topological and Modal Logic.Kurt Engesser - 1995 - Mathematical Logic Quarterly 41 (1):49-64.
An Infinitary Graded Modal Logic.Maurizio Fattorosi-Barnaba & Silvano Grassotti - 1995 - Mathematical Logic Quarterly 41 (4):547-563.
Proof-Theoretic Functional Completeness for the Hybrid Logics of Everywhere and Elsewhere.Torben Braüner - 2005 - Studia Logica 81 (2):191-226.
A logic with relative knowledge operators.Stéphane Demri - 1999 - Journal of Logic, Language and Information 8 (2):167-185.
Logic for update products and steps into the past.Joshua Sack - 2010 - Annals of Pure and Applied Logic 161 (12):1431-1461.
Simulating polyadic modal logics by monadic ones.George Goguadze, Carla Piazza & Yde Venema - 2003 - Journal of Symbolic Logic 68 (2):419-462.
Analytics
Added to PP
2009-01-28
Downloads
13 (#1,066,279)
6 months
39 (#100,216)
2009-01-28
Downloads
13 (#1,066,279)
6 months
39 (#100,216)
Historical graph of downloads
Citations of this work
Undecidable relativizations of algebras of relations.Szabolcs Mikulás & Maarten Marx - 1999 - Journal of Symbolic Logic 64 (2):747-760.
References found in this work
Cylindric Algebras. Part I.Leon Henkin, J. Donald Monk, Alfred Tarski, L. Henkin, J. D. Monk & A. Tarski - 1985 - Journal of Symbolic Logic 50 (1):234-237.
An irreflexivity lemma with applications to axiomatizations of conditions on tense frames.Dov M. Gabbay - 1981 - In U. Mönnich (ed.), Aspects of Philosophical Logic. Dordrecht. pp. 67--89.
Algebraization of quantifier logics, an introductory overview.István Németi - 1991 - Studia Logica 50 (3-4):485 - 569.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-68866f4b87-zhzfn uwo