Provably total functions of Basic Arithmetic

DOI10.1002/malq.200310032zbMath1026.03045WikidataQ57533083 ScholiaQ57533083MaRDI QIDQ4808473

Saeed Salehi

Publication date: 22 May 2003

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200310032

zbMATH Keywords

realizability; Basic Logic; provably total functions; Basic Arithmetic

Mathematics Subject Classification ID

03F30: First-order arithmetic and fragments

03D20: Recursive functions and relations, subrecursive hierarchies

03F65: Other constructive mathematics

03F50: Metamathematics of constructive systems

03F55: Intuitionistic mathematics

Related Items

THE NONARITHMETICITY OF THE PREDICATE LOGIC OF STRICTLY PRIMITIVE RECURSIVE REALIZABILITY, A Generalized Realizability and Intuitionistic Logic, Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability, Polynomially bounded recursive realizability, General recursive realizability and basic logic, 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, 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05