Strictly Primitive Recursive Realizability, II. Completeness with Respect to Iterated Reflection and a Primitive Recursive $\omega$ -Rule

Notre Dame Journal of Formal Logic 39 (3):363-388 (1998)
The notion of strictly primitive recursive realizability is further investigated, and the realizable prenex sentences, which coincide with primitive recursive truths of classical arithmetic, are characterized as precisely those provable in transfinite progressions over a fragment of intuitionistic arithmetic. The progressions are based on uniform reflection principles of bounded complexity iterated along initial segments of a primitive recursively formulated system of notations for constructive ordinals. A semiformal system closed under a primitive recursively restricted -rule is described and proved equivalent to the transfinite progressions with respect to the prenex sentences
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1305/ndjfl/1039182252
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,707
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Zlatan Damnjanovic (1997). Elementary Realizability. Journal of Philosophical Logic 26 (3):311-339.
Daniel E. Severin (2008). Unary Primitive Recursive Functions. Journal of Symbolic Logic 73 (4):1122-1138.
E. Grädel & A. Malmström (1999). 0-1 Laws for Recursive Structures. Archive for Mathematical Logic 38 (4-5):205-215.
Stephen H. McCleary (1967). Primitive Recursive Computations. Notre Dame Journal of Formal Logic 8 (4):311-317.

Monthly downloads

Added to index


Total downloads

10 ( #235,035 of 1,726,249 )

Recent downloads (6 months)

1 ( #369,877 of 1,726,249 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.