Computable Kripke models and intermediate logics

DOI10.1006/inco.1998.2704zbMath0913.03033OpenAlexW2002701178MaRDI QIDQ1271561

Hajime Ishihara, Bakhadyr Khoussainov, Anil Nerode

Publication date: 18 January 1999

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1998.2704

zbMATH Keywords

Kripke framesintermediate logicssemantic completenesscomputable modelseffectiveness of Kripke models

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Intermediate logics (03B55)

Related Items (2)

First-order logic in the Medvedev lattice ⋮ Decidable Kripke models of intuitionistic theories

Cites Work

• Semantical investigations in Heyting's intuitionistic logic
• Constructivism in mathematics. An introduction. Volume I
• Completeness theorem for Dummett's LC quantified and some of its extensions
• Directed frames
• Handbook of recursive mathematics. Vol. 1: Recursive model theory
• Decidable Kripke models of intuitionistic theories
• 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
• Intermediate predicate logics determined by ordinals
• The continuum and first-order intuitionistic logic
• Completeness properties of heyting's predicate calculus with respect to re models
• Computable Algebra, General Theory and Theory of Computable Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computable Kripke models and intermediate logics