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)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,530
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
Strictly Primitive Recursive Realizability, I.Zlatan Damnjanovic - 1994 - Journal of Symbolic Logic 59 (4):1210-1227.
A Cardinality Version of Biegel's Nonspeedup Theorem.James C. Owings Jr - 1989 - Journal of Symbolic Logic 54 (3):761-767.
Elementary Realizability.Zlatan Damnjanovic - 1997 - Journal of Philosophical Logic 26 (3):311-339.
Remarks on Peano Arithmetic.Charles Sayward - 2000 - Russell: The Journal of Bertrand Russell Studies 20 (1):27-32.
Some Restrictions on Simple Fixed Points of the Integers.G. L. McColm - 1989 - Journal of Symbolic Logic 54 (4):1324-1345.
Unary Primitive Recursive Functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.
0-1 Laws for Recursive Structures.E. Grädel & A. Malmström - 1999 - Archive for Mathematical Logic 38 (4-5):205-215.
Primitive Recursive Computations.Stephen H. McCleary - 1967 - Notre Dame Journal of Formal Logic 8 (4):311-317.
Primitive Recursion and the Chain Antichain Principle.Alexander P. Kreuzer - 2012 - Notre Dame Journal of Formal Logic 53 (2):245-265.
Added to PP index

Total downloads
12 ( #405,136 of 2,210,880 )

Recent downloads (6 months)
1 ( #357,939 of 2,210,880 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature