Polynomially bounded recursive realizability

DOI10.1305/ndjfl/1134397659zbMath1097.03051OpenAlexW1997250390WikidataQ57533063 ScholiaQ57533063MaRDI QIDQ817959

Saeed Salehi

Publication date: 23 March 2006

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

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

zbMATH Keywords

realizabilitybasic logicbasic arithmeticprimitive recursive functionpolynomially bounded recursive functionProvably total function

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Metamathematics of constructive systems (03F50)

Related Items

A counterexample to polynomially bounded realizability of basic arithmetic

Cites Work

• On the scheme of induction for bounded arithmetic formulas
• Constructivism in mathematics. An introduction. Volume I
• Elementary realizability
• Elementary interpretations of negationless arithmetic
• Strictly primitive recursive realizability, I
• How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q
• Provably total functions of Basic Arithmetic
• Minimal readability of intuitionistic arithmetic and elementary analysis
• Basic predicate calculus
• Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule
• Arithmetic complexity of the predicate logics of certain complete arithmetic theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item