Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Decidability of Quantified Propositional Intuitionistic Logic and S4 on Trees of Height and Arity ≤ ω

Richard Zach
Journal of Philosophical Logic
Vol. 33, No. 2 (Apr., 2004), pp. 155-164
Published by: Springer
Stable URL: http://www.jstor.org/stable/30226804
Page Count: 10
  • Download ($43.95)
  • Cite this Item
Preview not available

Abstract

Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers ∀p, ∃p, where the propositional variables range over upward-closed subsets of the set of worlds in a Kripke structure. If the permitted accessibility relations are arbitrary partial orders, the resulting logic is known to be recursively isomorphic to full second-order logic (Kremer, 1997). It is shown that if the Kripke structures are restricted to trees of at height and width at most ω, the resulting logics are decidable. This provides a partial answer to a question by Kremer. The result also transfers to modal S4 and some Gödel-Dummett logics with quantifiers over propositions.

Page Thumbnails

  • Thumbnail: Page 
[155]
    [155]
  • Thumbnail: Page 
156
    156
  • Thumbnail: Page 
157
    157
  • Thumbnail: Page 
158
    158
  • Thumbnail: Page 
159
    159
  • Thumbnail: Page 
160
    160
  • Thumbnail: Page 
161
    161
  • Thumbnail: Page 
162
    162
  • Thumbnail: Page 
163
    163
  • Thumbnail: Page 
164
    164