The superintuitionistic predicate logic of finite Kripke frames is not recursively axiomatizable

DOI10.2178/jsl/1120224722zbMath1086.03022OpenAlexW2029435309MaRDI QIDQ5718669

Dimitrij Skvortsov

Publication date: 16 January 2006

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

Full work available at URL: https://doi.org/10.2178/jsl/1120224722

zbMATH Keywords

intermediate predicate logicKripke incompletenessrecursive axiomatizabilityTrakhtenbrot's theoremfinite Kripke frame

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Intermediate logics (03B55)

Related Items

Complexity of finite-variable fragments of propositional temporal and modal logics of computation ⋮ A negative solution to Ono's problem P52: existence and disjunction properties in intermediate predicate logics

Cites Work

• Kripke completeness of some intermediate predicate logics with the axiom of constant domain and a variant of canonical formulas
• On the predicate logics of finite Kripke frames
• Not every ``tabular predicate logic is finitely axiomatizable