Basic predicate calculus

DOI10.1305/NDJFL/1039293019MaRDI QIDQ5937805zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 1028824
• scientific article; zbMATH DE number 1852928
• A basic theory with predicates
• Basic Propositional Calculus I
• Relational and partial variable sets and basic predicate logic
• A Gentzen-style axiomatization for basic predicate calculus
• Basic intuitionistic conditional logic
• Predicate logic, predicates, and terms
• scientific article; zbMATH DE number 194642
• Basic quantifier theory

Cites work

• A propositional logic with explicit fixed points
• Basic Propositional Calculus I
• scientific article; zbMATH DE number 3650529 (Why is no real title available?)
• scientific article; zbMATH DE number 30929 (Why is no real title available?)

Cited in

(30)

• Predicate logical extensions of some subintuitionistic logics
• A translation of intuitionistic predicate logic into basic predicate logic
• A Gentzen-style axiomatization for basic predicate calculus
• Sequent calculi for Visser's propositional logics
• Predicate calculus and metatheoretic concepts within a basic theory for the Foundations of Mathematics
• Fuzzy sets and formal logics
• A canonical model for constant domain basic first-order logic
• Proof complexity of substructural logics
• Not all Kripke models of \(\mathsf{HA}\) are locally \(\mathsf{PA}\)
• Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability
• General recursive realizability and intuitionistic logic
• Absolute L-realizability and intuitionistic logic
• A counterexample to polynomially bounded realizability of basic arithmetic
• Arithmetical realizability and primitive recursive realizability
• On hyperarithmetical realizability
• 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000. La Sorbonne, Paris, France, July 23-31, 2000
• Arithmetical realizability and basic logic
• 2004 Summer Meeting of the Association for Symbolic Logic
• 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05
• Alternative semantics for Visser's propositional logics
• Completions of Basic Algebras
• The de Jongh property for basic arithmetic
• BINARY KRIPKE SEMANTICS FOR A STRONG LOGIC FOR NAIVE TRUTH
• A Generalized Realizability and Intuitionistic Logic
• Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability
• A constructive interpretation of the logical constants
• Algorithmic properties of modal and superintuitionistic logics of monadic predicates over finite Kripke frames
• The provably total functions of basic arithmetic and its extensions
• Polynomially bounded recursive realizability
• General recursive realizability and basic logic

This page was built for publication: Basic predicate calculus

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