Journal of Philosophical Logic 26 (3):311-339 (1997)

Authors
Zlatan Damnjanovic
University of Southern California
Abstract
A realizability notion that employs only Kalmar elementary functions is defined, and, relative to it, the soundness of EA-(Π₁⁰-IR), a fragment of Heyting Arithmetic (HA) with names and axioms for all elementary functions and induction rule restricted to Π₁⁰ formulae, is proved. As a corollary, it is proved that the provably recursive functions of EA-(Π₁⁰-IR) are precisely the elementary functions. Elementary realizability is proposed as a model of strict arithmetic constructivism, which allows only those constructive procedures for which the amount of computational resources required can be bounded in advance
Keywords Philosophy
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1017994504149
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 70,039
Through your library

References found in this work BETA

Introduction to Metamathematics.Stephen Kleene - 1952 - Princeton, NJ, USA: North Holland.
Finitism.W. W. Tait - 1981 - Journal of Philosophy 78 (9):524-546.
Subrecursion: Functions and Hierarchies.H. E. Rose - 1984 - Oxford University Press.

View all 11 references / Add more references

Citations of this work BETA

Polynomially Bounded Recursive Realizability.Saeed Salehi - 2005 - Notre Dame Journal of Formal Logic 46 (4):407-417.
Elementary Functions and LOOP Programs.Zlatan Damnjanovic - 1994 - Notre Dame Journal of Formal Logic 35 (4):496-522.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
79 ( #146,513 of 2,506,009 )

Recent downloads (6 months)
1 ( #416,828 of 2,506,009 )

How can I increase my downloads?

Downloads

My notes