Provably total functions of Basic Arithmetic
From MaRDI portal
Recommendations
Cited in
(15)- Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability
- General recursive realizability and intuitionistic logic
- Generalized realizability for extensions of the language of arithmetic
- A counterexample to polynomially bounded realizability of basic arithmetic
- Arithmetical realizability and primitive recursive realizability
- Classifying the Provably Total Functions of PA
- 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05
- The de Jongh property for basic arithmetic
- THE NONARITHMETICITY OF THE PREDICATE LOGIC OF STRICTLY PRIMITIVE RECURSIVE REALIZABILITY
- scientific article; zbMATH DE number 7324257 (Why is no real title available?)
- A Generalized Realizability and Intuitionistic Logic
- Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability
- 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: Provably total functions of Basic Arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808473)