Decidability of quantified propositional intuitionistic logic and S4 on trees of height and arity \(\leq \omega\)

DOI10.1023/B:LOGI.0000021744.10237.d0zbMath1054.03011arXivmath/0203113MaRDI QIDQ1826435

Richard Zach

Publication date: 6 August 2004

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0203113

zbMATH Keywords

modal logicdecidabilityintuitionistic logicKripke modeltree structurequantified propositional formulas

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Model theory (03C99) Decidability of theories and sets of sentences (03B25) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items

On the logic of belief and propositional quantification ⋮ Unnamed Item ⋮ A note on algebraic semantics for \(\mathsf {S5}\) with propositional quantifiers

Cites Work

• Unnamed Item
• Unnamed Item
• Semantical investigations in Heyting's intuitionistic logic
• Propositional quantifiers in modal logic1
• On the complexity of propositional quantification in intuitionistic logic
• Quantifying over propositions in relevance logic: nonaxiomatisability of primary interpretations of ∀p and ∃p
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Some theorems about the sentential calculi of Lewis and Heyting