- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Primitive recursive analogues of regular cardinals based on ordinal representation systems for KPi and KPM
Archive for Mathematical Logic 44 (6):689-709 (2005)
Abstract
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 cardinalMy notes
Similar books and articles
How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals.Michael Rathjen - 1993 - Mathematical Logic Quarterly 39 (1):47-54.
An ordinal analysis of stability.Michael Rathjen - 2005 - Archive for Mathematical Logic 44 (1):1-62.
Assignment of Ordinals to Patterns of Resemblance.Gunnar Wilken - 2007 - Journal of Symbolic Logic 72 (2):704 - 720.
Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees.L. Gordeev - 1989 - Archive for Mathematical Logic 29 (1):29-46.
A Buchholz Derivation System for the Ordinal Analysis of KP + Π₃-Reflection.Markus Michelbrink - 2006 - Journal of Symbolic Logic 71 (4):1237 - 1283.
Ordinal diagrams for Π3-reflection.Toshiyasu Arai - 2000 - Journal of Symbolic Logic 65 (3):1375 - 1394.
How to assign ordinal numbers to combinatory terms with polymorphic types.William R. Stirton - 2012 - Archive for Mathematical Logic 51 (5-6):475-501.
Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM. [REVIEW]Michael Rathjen - 1994 - Archive for Mathematical Logic 33 (1):35-55.
On splitting stationary subsets of large cardinals.James E. Baumgartner, Alan D. Taylor & Stanley Wagon - 1977 - Journal of Symbolic Logic 42 (2):203-214.
On Ordinal Utility, Cardinal Utility and Random Utility.Richard Batley - 2008 - Theory and Decision 64 (1):37-63.
Ordinal diagrams for recursively Mahlo universes.Toshiyasu Arai - 2000 - Archive for Mathematical Logic 39 (5):353-391.
The cofinality spectrum of the infinite symmetric group.Saharon Shelah & Simon Thomas - 1997 - Journal of Symbolic Logic 62 (3):902-916.
The Bachmann-Howard Structure in Terms of Σ1-Elementarity.Gunnar Wilken - 2006 - Archive for Mathematical Logic 45 (7):807-829.
Variations on a theme by Weiermann.Toshiyasu Arai - 1998 - Journal of Symbolic Logic 63 (3):897-925.
Analytics
Added to PP
2013-11-23
Downloads
21 (#718,251)
6 months
5 (#629,136)
2013-11-23
Downloads
21 (#718,251)
6 months
5 (#629,136)
Historical graph of downloads
References found in this work
Set Theory: An Introduction to Large Cardinals.F. R. Drake & T. J. Jech - 1976 - British Journal for the Philosophy of Science 27 (2):187-191.
Proof-theoretic analysis of KPM.Michael Rathjen - 1991 - Archive for Mathematical Logic 30 (5-6):377-403.
Ordinal notations based on a weakly Mahlo cardinal.Michael Rathjen - 1990 - Archive for Mathematical Logic 29 (4):249-263.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-l2pxr uwo