The decidability of certain intermediate propositional logics

DOI10.2307/2269871zbMath0175.27103OpenAlexW1972938060MaRDI QIDQ5565105

C. G. McKay

Publication date: 1968

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

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

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (29)

Jankov Formulas and Axiomatization Techniques for Intermediate Logics ⋮ An algebraic approach to subframe logics. Intuitionistic case ⋮ Intermediate logics with the same disjunctionless fragment as intuitionistic logic ⋮ The undecidability of the disjunction property of propositional logics and other related problems ⋮ Disjunctive property of superintuitionist and modal logics ⋮ Characteristic formulas of partial Heyting algebras ⋮ Diego's theorem for nuclear implicative semilattices ⋮ The projective Beth property in well-composed logics ⋮ Canonical formulas for K4. Part I: Basic results ⋮ The decidability of Craig's interpolation property in well-composed J-logics ⋮ Admissible rules in the implication-negation fragment of intuitionistic logic ⋮ Finite axiomatization for some intermediate logics ⋮ Syntax and semantics of superintuitionistic logics ⋮ Residuated Structures, Concentric Sums and Finiteness Conditions ⋮ Canonical formulas for K4. Part II: Cofinal subframe logics ⋮ A semantic hierarchy for intuitionistic logic ⋮ Kripke completeness of some intermediate predicate logics with the axiom of constant domain and a variant of canonical formulas ⋮ Splitting algebras and a weak notion of projectivity ⋮ Equational axioms for classes of Heyting algebras ⋮ Some results concerning finite model separability of propositional calculi ⋮ EXISTENTIALLY CLOSED BROUWERIAN SEMILATTICES ⋮ Properties of superintuitionistic propositional calculi ⋮ On the extension of intuitionistic propositional logic with Kreisel- Putnam's and Scott's schemes ⋮ AN ALGEBRAIC APPROACH TO CANONICAL FORMULAS: INTUITIONISTIC CASE ⋮ Kripke models and intermediate logics ⋮ Axiomatization of models for intermediate logics constructed with Boolean models by piling up ⋮ Separability of normalizable superintuitionistic propositional logics ⋮ Semiconic idempotent residuated structures ⋮ Characteristic inference rules

Cites Work

• Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül

This page was built for publication: The decidability of certain intermediate propositional logics