On the complexity of propositional quantification in intuitionistic logic

DOI10.2307/2275545zbMATH Open0887.03002OpenAlexW2163197731MaRDI QIDQ4358053FDOQ4358053

Authors: Philip Kremer 

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

Recommendations

• scientific article; zbMATH DE number 1088204
• On propositional quantifiers in provability logic
• Complexity of intuitionistic propositional logic and its fragments
• scientific article; zbMATH DE number 3995647
• scientific article; zbMATH DE number 2015268
• The complexity of the disjunction and existential properties in intuitionistic logic
• scientific article; zbMATH DE number 3976993
• scientific article; zbMATH DE number 1390276
• Propositional quantification in the monadic fragment of intuitionistic logic
• On the computational content of intuitionistic propositional proofs

zbMATH Keywords

intuitionistic logicpropositional quantificationrecursively isomorphicclassical second order logic

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20)

Cites Work

• Semantical investigations in Heyting's intuitionistic logic

Cited In (33)

• Expressivity of second order propositional modal logic
• Complexity of subclasses of the intuitionistic propositional calculus
• Representability in second-order propositional poly-modal logic
• The complexity of disjunction in intuitionistic logic
• Title not available (Why is that?)
• On the logic of belief and propositional quantification
• Logics for propositional contingentism
• Restricted positive quantification is not elementary
• On Decidability of a Logic for Order of Magnitude Qualitative Reasoning with Bidirectional Negligibility
• Title not available (Why is that?)
• Uniform interpolation and propositional quantifiers in modal logics
• Linear Kripke frames and Gödel logics
• Uniform interpolation and the existence of sequent calculi
• Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?
• On propositional quantifiers in provability logic
• Second-order propositional modal logic and monadic alternation hierarchies
• A Splitting Algorithm Based on Soft Constraints for the Computation of Truth Degree in Quantitative Logic
• Computational complexity of theories of a binary predicate with a small number of variables
• Propositional quantification in the topological semantics for \(\mathbf S4\)
• Quantified multimodal logics in simple type theory
• Pitts' quantifiers are not topological quantification
• 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
• How hard is positive quantification?
• Non-axiomatizable second order intuitionistic propositional logic
• On the homogeneity property for certain quantifier logics
• Decidability of quantified propositional intuitionistic logic and S4 on trees of height and arity \(\leq \omega\)
• Mereotopology in 2nd-order and modal extensions of intuitionistic propositional logic
• On the number of new logical constants in intuitionistic propositional calculus
• Axiomatizability of propositionally quantified modal logics on relational frames
• Title not available (Why is that?)
• Completeness of second-order propositional S4 and H in topological semantics
• Statistics of intuitionistic versus classical logics

This page was built for publication: On the complexity of propositional quantification in intuitionistic logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4358053)