David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 49 (2):197 - 214 (1990)
We illustrate, with three examples, the interaction between boolean and modal connectives by looking at the role of truth-functional reasoning in the provision of completeness proofs for normal modal logics. The first example (§ 1) is of a logic (more accurately: range of logics) which is incomplete in the sense of being determined by no class of Kripke frames, where the incompleteness is entirely due to the lack of boolean negation amongst the underlying non-modal connectives. The second example (§ 2) focusses on the breakdown, in the absence of boolean disjunction, of the usual canonical model argument for the logic of dense Kripke frames, though a proof of incompleteness with respect to the Kripke semantics is not offered. An alternative semantic account is developed, in terms of which a completeness proof can be given, and this is used (§ 3) in the discussion of the third example, a bimodal logic which is, as with the first example, provably incomplete in terms of the Kripke semantics, the incompleteness being due to the lack of disjunction (as a primitive or defined boolean connective).
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
I. L. Humberstone (1985). The Formalities of Collective Omniscience. Philosophical Studies 48 (3):401 - 423.
David Makinson (1973). A Warning About the Choice of Primitive Operators in Modal Logic. Journal of Philosophical Logic 2 (2):193 - 196.
Dana Scott (1971). On Engendering an Illusion of Understanding. Journal of Philosophy 68 (21):787-807.
Krister Segerberg (1968). Decidability of S4. Theoria 34 (1):7-20.
Krister Segerberg (1967). Some Modal Logics Based on a Three-Valued Logic. Theoria 33 (1):53-71.
Citations of this work BETA
No citations found.
Similar books and articles
Ernst Zimmermann (2003). Elementary Definability and Completeness in General and Positive Modal Logic. Journal of Logic, Language and Information 12 (1):99-117.
Torben Braüner (2005). Proof-Theoretic Functional Completeness for the Hybrid Logics of Everywhere and Elsewhere. Studia Logica 81 (2):191 - 226.
Steve Giambrone & Robert K. Meyer (1989). Completeness and Conservative Extension Results for Some Boolean Relevant Logics. Studia Logica 48 (1):1 - 14.
Takahiro Seki (2003). A Sahlqvist Theorem for Relevant Modal Logics. Studia Logica 73 (3):383 - 411.
M. J. Cresswell (1995). Incompleteness and the Barcan Formula. Journal of Philosophical Logic 24 (4):379 - 403.
Gerard Allwein, Hilmi Demir & Lee Pike (2004). Logics for Classes of Boolean Monoids. Journal of Logic, Language and Information 13 (3):241-266.
Norihiro Kamide (2002). Kripke Semantics for Modal Substructural Logics. Journal of Logic, Language and Information 11 (4):453-470.
Tatsuya Shimura (2000). Kripke Incompleteness of Predicate Extensions of the Modal Logics Axiomatized by a Canonical Formula for a Frame with a Nontrivial Cluster. Studia Logica 65 (2):237-247.
Wiesław Dziobiak (1981). Strong Completeness with Respect to Finite Kripke Models. Studia Logica 40 (3):249 - 252.
Paolo Gentilini (1993). Syntactical Results on the Arithmetical Completeness of Modal Logic. Studia Logica 52 (4):549 - 564.
Added to index2009-01-28
Total downloads19 ( #96,214 of 1,140,341 )
Recent downloads (6 months)1 ( #140,127 of 1,140,341 )
How can I increase my downloads?