Decidable Kripke models of intuitionistic theories

DOI10.1016/S0168-0072(97)00057-2zbMath0924.03060OpenAlexW2093510572MaRDI QIDQ1295382

Hajime Ishihara, Bakhadyr Khoussainov, Anil Nerode

Publication date: 16 November 1999

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(97)00057-2

zbMATH Keywords

effectivenessKripke modelcomputable theorydecidable forcingmodel theory of intuitionistic logic

Mathematics Subject Classification ID

Nonclassical models (Boolean-valued, sheaf, etc.) (03C90) Computable structure theory, computable model theory (03C57)

Related Items

Effective completeness theorems for modal logic ⋮ First-order logic in the Medvedev lattice ⋮ Reverse mathematics and completeness theorems for intuitionistic logic ⋮ Computable Kripke models and intermediate logics ⋮ Maximal ideals in countable rings, constructively

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantical investigations in Heyting's intuitionistic logic
• Constructivism in mathematics. An introduction. Volume II
• Computable Kripke models and intermediate logics
• A context for belief revision: forward chaining-normal nonmonotonic rule systems
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• Effective procedures in field theory
• Computable Algebra, General Theory and Theory of Computable Fields