Loading AI tools
Large cardinal number that is hard to describe in a given language From Wikipedia, the free encyclopedia
In set theory, a branch of mathematics, a Q-indescribable cardinal is a certain kind of large cardinal number that is hard to axiomatize in some language Q. There are many different types of indescribable cardinals corresponding to different choices of languages Q. They were introduced by Hanf & Scott (1961).
This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (June 2022) |
A cardinal number is called -indescribable if for every proposition , and set with there exists an with .[1] Following Lévy's hierarchy, here one looks at formulas with m-1 alternations of quantifiers with the outermost quantifier being universal. -indescribable cardinals are defined in a similar way, but with an outermost existential quantifier. Prior to defining the structure , one new predicate symbol is added to the language of set theory, which is interpreted as .[2] The idea is that cannot be distinguished (looking from below) from smaller cardinals by any formula of n+1-th order logic with m-1 alternations of quantifiers even with the advantage of an extra unary predicate symbol (for A). This implies that it is large because it means that there must be many smaller cardinals with similar properties. [citation needed]
The cardinal number is called totally indescribable if it is -indescribable for all positive integers m and n.
If is an ordinal, the cardinal number is called -indescribable if for every formula and every subset of such that holds in there is a some such that holds in . If is infinite then -indescribable ordinals are totally indescribable, and if is finite they are the same as -indescribable ordinals. There is no that is -indescribable, nor does -indescribability necessarily imply -indescribability for any , but there is an alternative notion of shrewd cardinals that makes sense when : if holds in , then there are and such that holds in .[3] However, it is possible that a cardinal is -indescribable for much greater than .[1]Ch. 9, theorem 4.3
Originally, a cardinal κ was called Q-indescribable if for every Q-formula and relation , if then there exists an such that .[4][5] Using this definition, is -indescribable iff is regular and greater than .[5]p.207 The cardinals satisfying the above version based on the cumulative hierarchy were called strongly Q-indescribable.[6] This property has also been referred to as "ordinal -indescribability".[7]p.32
A cardinal is -indescribable iff it is -indescribable.[8] A cardinal is inaccessible if and only if it is -indescribable for all positive integers , equivalently iff it is -indescribable, equivalently if it is -indescribable.
-indescribable cardinals are the same as weakly compact cardinals.
The indescribability condition is equivalent to satisfying the reflection principle (which is provable in ZFC), but extended by allowing higher-order formulae with a second-order free variable.[8]
For cardinals , say that an elementary embedding a small embedding if is transitive and . For any natural number , is -indescribable iff there is an such that for all there is a small embedding such that .[9], Corollary 4.3
If V=L, then for a natural number n>0, an uncountable cardinal is Π1
n-indescribable iff it's (n+1)-stationary.[10]
For a class of ordinals and a -indescribable cardinal , is said to be enforced at (by some formula of ) if there is a -formula and an such that , but for no with does hold.[1]p.277 This gives a tool to show necessary properties of indescribable cardinals.
The property of being -indescribable is over , i.e. there is a sentence that satisfies iff is -indescribable.[11] For , the property of being -indescribable is and the property of being -indescribable is .[11] Thus, for , every cardinal that is either -indescribable or -indescribable is both -indescribable and -indescribable and the set of such cardinals below it is stationary. The consistency strength of -indescribable cardinals is below that of -indescribable, but for it is consistent with ZFC that the least -indescribable exists and is above the least -indescribable cardinal (this is proved from consistency of ZFC with -indescribable cardinal and a -indescribable cardinal above it).[citation needed]
Totally indescribable cardinals remain totally indescribable in the constructible universe and in other canonical inner models, and similarly for - and -indescribability.
For natural number , if a cardinal is -indescribable, there is an ordinal such that , where denotes elementary equivalence.[12] For this is a biconditional (see Two model-theoretic characterisations of inaccessibility).
Measurable cardinals are -indescribable, but the smallest measurable cardinal is not -indescribable. However, assuming choice, there are many totally indescribable cardinals below any measurable cardinal.
For , ZFC+"there is a -indescribable cardinal" is equiconsistent with ZFC+"there is a -indescribable cardinal such that ", i.e. "GCH fails at a -indescribable cardinal".[8]
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.