Journal of Symbolic Logic 59 (4):1210-1227 (1994)

Authors
Zlatan Damnjanovic
University of Southern California
Abstract
A realizability notion that employs only primitive recursive functions is defined, and, relative to it, the soundness of the fragment of Heyting Arithmetic (HA) in which induction is restricted to Σ 0 1 formulae is proved. A dual concept of falsifiability is proposed and an analogous soundness result is established for a further restricted fragment of HA
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275700
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: 61,089
Through your library

References found in this work BETA

Introduction to Metamathematics.H. Rasiowa - 1954 - Journal of Symbolic Logic 19 (3):215-216.
Enumeration and the Grzegorczyk Hierarchy.Paul Axt - 1963 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9 (1-4):53-65.
Enumeration and the Grzegorczyk Hierarchy.Paul Axt - 1963 - Mathematical Logic Quarterly 9 (1‐4):53-65.
Equivalence of Some Hierarchies of Primitive Recursive Functions.Keith Harrow - 1979 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (25-29):411-418.
Equivalence of Some Hierarchies of Primitive Recursive Functions.Keith Harrow - 1979 - Mathematical Logic Quarterly 25 (25‐29):411-418.

Add more references

Citations of this work BETA

Elementary Realizability.Zlatan Damnjanovic - 1997 - Journal of Philosophical Logic 26 (3):311-339.
Polynomially Bounded Recursive Realizability.Saeed Salehi - 2005 - Notre Dame Journal of Formal Logic 46 (4):407-417.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
71 ( #147,154 of 2,440,151 )

Recent downloads (6 months)
3 ( #208,966 of 2,440,151 )

How can I increase my downloads?

Downloads

My notes