Access the full text.
Sign up today, get DeepDyve free for 14 days.
O. Takaki (2003)
Primitive recursive analogues of the least regular cardinal and the least weakly inaccessible cardinal, 57
M. Rathjen (2007)
The Realm of Ordinal Analysis
A. Kanamori (1994)
The Higher Infinite
W. Pohlers (1998)
Chapter IV – Subsystems of Set Theory and Second Order Number TheoryStudies in logic and the foundations of mathematics, 137
M. Rathjen (1995)
The Higher Infinite in Proof Theory
M. Rathjen, S. Cooper, J. Truss (1999)
The Realm of Orinal Analysis
W. Buchholz (1993)
A simplified version of local predicativity
M. Rathjen (1991)
Proof-theoretic analysis of KPMArchive for Mathematical Logic, 30
W. Buchholz (1993)
A note on the ordinal analysis of KPM
F. Drake (1974)
Set theory : an introduction to large cardinals
M. Rathjen (1990)
Ordinal notations based on a weakly Mahlo cardinalArchive for Mathematical Logic, 29
In this paper, we develop primitive recursive analogues of regular cardinals by using ordinal representation systems for KPi and KPM. We also define primitive recursive analogues of inaccessible and hyperinaccessible cardinals. Moreover, we characterize the primitive recursive analogue of the least (uncountable) regular cardinal.
Archive for Mathematical Logic – Springer Journals
Published: Jul 6, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.