Decidability of some intuitionistic predicate theories

DOI10.2307/2272747MaRDI QIDQ5681990zbMATH OpenOpenAlexFDO

Authors Dov Gabbay

Publication date 1972

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2272747

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Intuitionistic mathematics (03F55)

Cites work

• Certain logical reduction and decision problems
• Logic with truth values in A linearly ordered heyting algebra
• Sufficient conditions for the undecidability of intuitionistic theories with applications

Cited in

(10)

• Invertible infinitary calculus without loop rules for restricted FTL
• Monadic Fragments of Gödel Logics: Decidability and Undecidability Results
• Investigation of finitary calculus for a discrete linear time logic by means of infinitary calculus
• SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability
• On 2nd order intuitionistic propositional calculus with full comprehension
• Elementary intuitionistic theories
• Sufficient conditions for the undecidability of intuitionistic theories with applications
• The undecidability of intuitionistic theories of algebraically closed fields and real closed fields
• The decision problem for some finite extensions of the intuitionistic theory of abelian groups
• A proof-theoretical investigation of global intuitionistic (fuzzy) logic

This page was built for publication: Decidability of some intuitionistic predicate theories

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