Computable Kripke models and intermediate logics

DOI10.1006/INCO.1998.2704MaRDI QIDQ1271561zbMATH OpenOpenAlexFDO

Authors Hajime Ishihara, Bakhadyr Khoussainov, Anil Nerode

Publication date 18 January 1999

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

computable modelseffectiveness of Kripke modelsintermediate logicsKripke framessemantic completeness

Mathematics Subject Classification ID

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

Review text

In the paper under review the authors investigate effectiveness of Kripke models for first-order theories of intermediate logics, i.e. those that lie between intuitionistic and classical predicate logic. Completeness (by Kripke) results for intermediate logics such as intuitionistic logic, classical logic, constant domain logic, directed frames logic, and Dummett's logic are obtained.

Recommendations

• Decidable Kripke models of intuitionistic theories
• scientific article; zbMATH DE number 3837996
• Effective completeness theorems for modal logic
• On some Kripke complete and Kripke incomplete intermediate predicate logics
• scientific article; zbMATH DE number 759444

Cites work

• Completeness properties of heyting's predicate calculus with respect to re models
• Completeness theorem for Dummett's LC quantified and some of its extensions
• Computable Algebra, General Theory and Theory of Computable Fields
• Constructivism in mathematics. An introduction. Volume I
• Decidable Kripke models of intuitionistic theories
• Directed frames
• Effective procedures in field theory
• Handbook of recursive mathematics. Vol. 1: Recursive model theory
• scientific article; zbMATH DE number 3821696 (Why is no real title available?)
• scientific article; zbMATH DE number 3713669 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1048041 (Why is no real title available?)
• Intermediate predicate logics determined by ordinals
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• Semantical investigations in Heyting's intuitionistic logic
• The continuum and first-order intuitionistic logic

Cited in

(11)

• Decidable Kripke models of intuitionistic theories
• Effective completeness theorems for modal logic
• scientific article; zbMATH DE number 3933040 (Why is no real title available?)
• scientific article; zbMATH DE number 937394 (Why is no real title available?)
• Completeness of intermediate logics with doubly negated axioms
• scientific article; zbMATH DE number 6302903 (Why is no real title available?)
• New Computational Paradigms
• Effectiveness in RPL, with applications to continuous logic
• Kripke models for classical logic
• First-order logic in the Medvedev lattice
• Kripke models, distributive lattices, and Medvedev degrees

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

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