Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Primitive recursive analogues of regular cardinals based on ordinal representation systems for KPi and KPM

Primitive recursive analogues of regular cardinals based on ordinal representation systems for... 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Archive for Mathematical Logic Springer Journals

Primitive recursive analogues of regular cardinals based on ordinal representation systems for KPi and KPM

Archive for Mathematical Logic , Volume 44 (6) – Jul 6, 2005

Loading next page...
 
/lp/springer-journals/primitive-recursive-analogues-of-regular-cardinals-based-on-ordinal-9yrVXPz6Jw

References (11)

Publisher
Springer Journals
Copyright
Copyright © 2005 by Springer-Verlag Berlin Heidelberg
Subject
Mathematics; Mathematics, general; Algebra; Mathematical Logic and Foundations
ISSN
0933-5846
eISSN
1432-0665
DOI
10.1007/s00153-005-0308-9
Publisher site
See Article on Publisher Site

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 cardinal.

Journal

Archive for Mathematical LogicSpringer Journals

Published: Jul 6, 2005

There are no references for this article.