On the complexity of propositional quantification in intuitionistic logic
From MaRDI portal
Publication:4358053
DOI10.2307/2275545zbMath0887.03002OpenAlexW2163197731MaRDI QIDQ4358053
Publication date: 6 May 1998
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275545
Related Items (20)
Non-axiomatizable second order intuitionistic propositional logic ⋮ Uniform interpolation and propositional quantifiers in modal logics ⋮ Propositional quantification in the topological semantics for \(\mathbf S4\) ⋮ Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино? ⋮ Quantified multimodal logics in simple type theory ⋮ Computational complexity of theories of a binary predicate with a small number of variables ⋮ Second-order propositional modal logic and monadic alternation hierarchies ⋮ On the logic of belief and propositional quantification ⋮ Pitts' quantifiers are not topological quantification ⋮ Expressivity of second order propositional modal logic ⋮ Unnamed Item ⋮ COMPLETENESS OF SECOND-ORDER PROPOSITIONAL S4 AND H IN TOPOLOGICAL SEMANTICS ⋮ Mereotopology in 2nd-Order and Modal Extensions of Intuitionistic Propositional Logic ⋮ Decidability of quantified propositional intuitionistic logic and S4 on trees of height and arity \(\leq \omega\) ⋮ A note on algebraic semantics for \(\mathsf {S5}\) with propositional quantifiers ⋮ Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter ⋮ Uniform interpolation and the existence of sequent calculi ⋮ Linear Kripke frames and Gödel logics ⋮ LOGICS FOR PROPOSITIONAL CONTINGENTISM ⋮ Representability in second-order propositional poly-modal logic
Cites Work
This page was built for publication: On the complexity of propositional quantification in intuitionistic logic
