Basic predicate calculus

DOI10.1305/ndjfl/1039293019zbMath0967.03005OpenAlexW2086177561MaRDI QIDQ5937805

Wim Ruitenburg

Publication date: 17 July 2001

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1039293019

zbMATH Keywords

basic logiccompleteness theoremfirst-order basic predicate logicfunctional well-formed theoryKripke modelsundecidability of basic arithmetic

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) First-order arithmetic and fragments (03F30) Nonclassical models (Boolean-valued, sheaf, etc.) (03C90) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items

On hyperarithmetical realizability ⋮ Arithmetical realizability and primitive recursive realizability ⋮ A Generalized Realizability and Intuitionistic Logic ⋮ General recursive realizability and basic logic ⋮ Arithmetical realizability and basic logic ⋮ Alternative Semantics for Visser’s Propositional Logics ⋮ BINARY KRIPKE SEMANTICS FOR A STRONG LOGIC FOR NAIVE TRUTH ⋮ Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability ⋮ Sequent calculi for Visser's propositional logics ⋮ The de Jongh property for basic arithmetic ⋮ 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000 ⋮ General recursive realizability and intuitionistic logic ⋮ Fuzzy sets and formal logics ⋮ A canonical model for constant domain basic first-order logic ⋮ Proof complexity of substructural logics ⋮ 2004 Summer Meeting of the Association for Symbolic Logic ⋮ Predicate logical extensions of some subintuitionistic logics ⋮ Completions of Basic Algebras ⋮ Absolute \(L\)-realizability and intuitionistic logic ⋮ Not all Kripke models of \(\mathsf{HA}\) are locally \(\mathsf{PA}\) ⋮ A counterexample to polynomially bounded realizability of basic arithmetic ⋮ 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05 ⋮ Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability ⋮ Polynomially bounded recursive realizability

Cites Work

• A propositional logic with explicit fixed points
• Basic Propositional Calculus I
• Unnamed Item
• Unnamed Item