Polynomially bounded recursive realizability

DOI10.1305/NDJFL/1134397659MaRDI QIDQ817959zbMATH OpenOpenAlexWikidataFDO

Authors 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 arithmeticpolynomially bounded recursive functionprimitive recursive functionProvably total function

Mathematics Subject Classification ID

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

Recommendations

• Provably total functions of Basic Arithmetic
• Functional interpretations of feasibly constructive arithmetic
• scientific article; zbMATH DE number 440477
• Minimal readability of intuitionistic arithmetic and elementary analysis
• Strictly primitive recursive realizability, I

Cites work

• scientific article; zbMATH DE number 65747 (Why is no real title available?)
• scientific article; zbMATH DE number 1144041 (Why is no real title available?)
• scientific article; zbMATH DE number 2019914 (Why is no real title available?)
• Arithmetic complexity of the predicate logics of certain complete arithmetic theories
• Basic predicate calculus
• Constructivism in mathematics. An introduction. Volume I
• Elementary interpretations of negationless arithmetic
• Elementary realizability
• How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q
• Minimal readability of intuitionistic arithmetic and elementary analysis
• On the scheme of induction for bounded arithmetic formulas
• Provably total functions of Basic Arithmetic
• Recursively enumerable sets and degrees. A study of computable functions and computably generated sets. Translated from the English. Translation edited and with a preface by M. M. Arslanov.
• Strictly primitive recursive realizability, I
• Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule

Cited in

(5)

• A strong induction scheme that leads to polynomially computable realizations
• Bounded theories for polyspace computability
• A counterexample to polynomially bounded realizability of basic arithmetic
• Functional interpretations of feasibly constructive arithmetic
• Provably total functions of Basic Arithmetic

This page was built for publication: Polynomially bounded recursive realizability

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