Representability in second-order propositional poly-modal logic
Journal of Symbolic Logic 67 (3):1039-1054 (2002)
| Abstract | A propositional system of modal logic is second-order if it contains quantifiers ∀p and ∃p, which, in the standard interpretation, are construed as ranging over sets of possible worlds (propositions). Most second-order systems of modal logic are highly intractable; for instance, when augmented with propositional quantifiers, K, B, T, K4 and S4 all become effectively equivalent to full second-order logic. An exception is S5, which, being interpretable in monadic second-order logic, is decidable | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,653 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesPhilip Kremer (1997). On the Complexity of Propositional Quantification in Intuitionistic Logic. Journal of Symbolic Logic 62 (2):529-544.
Melvin Fitting (2002). Interpolation for First Order S5. Journal of Symbolic Logic 67 (2):621-634.
Balder ten Cate (2006). Expressivity of Second Order Propositional Modal Logic. Journal of Philosophical Logic 35 (2).
Balder ten Cate (2006). Expressivity of Second Order Propositional Modal Logic. Journal of Philosophical Logic 35 (2):209 - 223.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads20 ( #61,442 of 548,984 )Recent downloads (6 months)3 ( #25,729 of 548,984 )How can I increase my downloads? |
My notes
Discussion
