Translator Disclaimer
2005 Polynomially Bounded Recursive Realizability
Saeed Salehi
Notre Dame J. Formal Logic 46(4): 407-417 (2005). DOI: 10.1305/ndjfl/1134397659

Abstract

A polynomially bounded recursive realizability, in which the recursive functions used in Kleene's realizability are restricted to polynomially bounded functions, is introduced. It is used to show that provably total functions of Ruitenburg's Basic Arithmetic are polynomially bounded (primitive) recursive functions. This sharpens our earlier result where those functions were proved to be primitive recursive. Also a polynomially bounded schema of Church's Thesis is shown to be polynomially bounded realizable. So the schema is consistent with Basic Arithmetic, whereas it is inconsistent with Heyting Arithmetic.

Citation

Download Citation

Saeed Salehi. "Polynomially Bounded Recursive Realizability." Notre Dame J. Formal Logic 46 (4) 407 - 417, 2005. https://doi.org/10.1305/ndjfl/1134397659

Information

Published: 2005
First available in Project Euclid: 12 December 2005

zbMATH: 1097.03051
MathSciNet: MR2183051
Digital Object Identifier: 10.1305/ndjfl/1134397659

Subjects:
Primary: 03F30
Secondary: 03F50

Rights: Copyright © 2005 University of Notre Dame

JOURNAL ARTICLE
11 PAGES


SHARE
Vol.46 • No. 4 • 2005
Back to Top