Elementary intuitionistic theories

DOI10.2307/2271732MaRDI QIDQ5676209zbMATH OpenOpenAlexFDO

Authors Craig Smoryński

Publication date 1973

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

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

Mathematics Subject Classification ID

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

Cites work

• Certain logical reduction and decision problems
• Decidability of some intuitionistic predicate theories
• Solvable cases of the decision problem
• Sufficient conditions for the undecidability of intuitionistic theories with applications

Cited in

(9)

• The Skolemization of existential quantifiers in intuitionistic logic
• On a second order propositional operator in intuitionistic logic
• 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02
• Connectification for n-contraction
• Hilbert's Nullstellensatz revisited
• Three ways of recognizing inessential formulas in sequents
• The real-algebraic structure of Scott's model of intuitionistic analysis
• The eskolemization of universal quantifiers
• Encoding true second‐order arithmetic in the real‐algebraic structure of models of intuitionistic elementary analysis

This page was built for publication: Elementary intuitionistic theories

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