𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Subtle cardinals and linear orderings

✍ Scribed by Harvey M. Friedman


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
228 KB
Volume
107
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.

✦ Synopsis


The subtle, almost ine able, and ine able cardinals were introduced in an unpublished 1971 manuscript of R. Jensen and K. Kunen. The concepts were extended to that of k-subtle, k-almost ine able, and k-ine able cardinals in 1975 by J. Baumgartner. In this paper we give a self contained treatment of the basic facts about this level of the large cardinal hierarchy, which were established by J. Baumgartner. In particular, we give a proof that the k-subtle, k-almost ine able, and k-ine able cardinals deΓΏne three properly intertwined hierarchies with the same limit, lying strictly above "total indescribability" and strictly below "arrowing !".

The innovation here is presented in Section 2, where we take a distinctly minimalist approach. Here the subtle cardinal hierarchy is characterized by very elementary properties that do not mention closed unbounded or stationary sets. This development culminates in a characterization of the hierarchy by means of a striking universal second-order property of linear orderings (k-critical).


πŸ“œ SIMILAR VOLUMES


Ξ”20-categoricity in Boolean algebras and
✍ Charles F.D. McCoy πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 328 KB

We characterize 0 2 -categoricity in Boolean algebras and linear orderings under some extra e ectiveness conditions. We begin with a study of the relativized notion in these structures.

Computable choice functions for computab
✍ Manuel Lerman; Richard Watnick πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 351 KB

## Abstract A choice set for a computable linear ordering is a set which contains one element from each maximal block of the ordering. We obtain a partial characterization of the computable linear order‐types for which each computable model has a computable choice set, and a full characterization i