On 2nd order intuitionistic propositional calculus with full comprehension

DOI10.1007/BF02015377MaRDI QIDQ4777262zbMATH OpenOpenAlexFDO

Authors Dov Gabbay

Publication date 1974

Published in Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/137894

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Intermediate logics (03B55)

Cites work

• scientific article; zbMATH DE number 3252193 (Why is no real title available?)
• A logic stronger than intuitionism
• Applications of trees to intermediate logics
• Decidability of some intuitionistic predicate theories
• Propositional quantifiers in modal logic1
• Sufficient conditions for the undecidability of intuitionistic theories with applications
• The undecidability of intuitionistic theories of algebraically closed fields and real closed fields

Cited in

(18)

• Propositional quantification in the topological semantics for \(\mathbf S4\)
• Mereotopology in 2nd-order and modal extensions of intuitionistic propositional logic
• Non-axiomatizable second order intuitionistic propositional logic
• Craig interpolation theorem for intuitionistic logic and extensions Part III
• Description of all functions definable by formulae of the 2nd order intuitionistic propositional calculus on some linear Heyting algebras
• The existential fragment of second-order propositional intuitionistic logic is undecidable
• A content semantics for quantified relevant logics. II
• scientific article; zbMATH DE number 7561487 (Why is no real title available?)
• On some new intuitionistic propositional connectives. I
• Quantification and RM
• The intuitionistic propositional calculus with quantifiers
• A sequent calculus for subtyping polymorphic types
• A note on algebraic semantics for \(\mathsf {S5}\) with propositional quantifiers
• Completeness of second-order propositional S4 and H in topological semantics
• A content semantics for quantified relevant logics. I
• Propositional quantification in the monadic fragment of intuitionistic logic
• Positive modal logic
• \(\supset\)E is admissible in ``true relevant arithmetic

This page was built for publication: On 2nd order intuitionistic propositional calculus with full comprehension

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