About: Shrewd cardinal     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Whole100003553, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FShrewd_cardinal&invfp=IFP_OFF&sas=SAME_AS_OFF

In mathematics, a shrewd cardinal is a certain kind of large cardinal number introduced by, extending the definition of indescribable cardinals. For an ordinal λ, a cardinal number κ is called λ-shrewd if for every proposition φ, and set A ⊆ Vκ with (Vκ+λ, ∈, A) ⊧ φ there exists an α, λ' < κ with (Vα+λ', ∈, A ∩ Vα) ⊧ φ. It is called shrewd if it is λ-shrewd for every λ(Definition 4.1) (including λ > κ). For finite n, an n-Πm-shrewd cardinals is the same thing as a Πmn-indescribable cardinal.

AttributesValues
rdf:type
rdfs:label
  • Shrewd cardinal (en)
rdfs:comment
  • In mathematics, a shrewd cardinal is a certain kind of large cardinal number introduced by, extending the definition of indescribable cardinals. For an ordinal λ, a cardinal number κ is called λ-shrewd if for every proposition φ, and set A ⊆ Vκ with (Vκ+λ, ∈, A) ⊧ φ there exists an α, λ' < κ with (Vα+λ', ∈, A ∩ Vα) ⊧ φ. It is called shrewd if it is λ-shrewd for every λ(Definition 4.1) (including λ > κ). For finite n, an n-Πm-shrewd cardinals is the same thing as a Πmn-indescribable cardinal. (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • In mathematics, a shrewd cardinal is a certain kind of large cardinal number introduced by, extending the definition of indescribable cardinals. For an ordinal λ, a cardinal number κ is called λ-shrewd if for every proposition φ, and set A ⊆ Vκ with (Vκ+λ, ∈, A) ⊧ φ there exists an α, λ' < κ with (Vα+λ', ∈, A ∩ Vα) ⊧ φ. It is called shrewd if it is λ-shrewd for every λ(Definition 4.1) (including λ > κ). This definition extends the concept of indescribability to transfinite levels. A λ-shrewd cardinal is also μ-shrewd for any ordinal μ < λ.(Corollary 4.3) Shrewdness was developed by as part of his ordinal analysis of Π12-comprehension. It is essentially the nonrecursive analog to the property for admissible ordinals. More generally, a cardinal number κ is called λ-Πm-shrewd if for every Πm proposition φ, and set A ⊆ Vκ with (Vκ+λ, ∈, A) ⊧ φ there exists an α, λ' < κ with (Vα+λ', ∈, A ∩ Vα) ⊧ φ.(Definition 4.1) Πm is one of the levels of the Lévy hierarchy, in short one looks at formulas with m-1 alternations of quantifiers with the outermost quantifier being universal. For finite n, an n-Πm-shrewd cardinals is the same thing as a Πmn-indescribable cardinal. If κ is a subtle cardinal, then the set of κ-shrewd cardinals is stationary in κ.(Lemma 4.6) Rathjen does not state how shrewd cardinals compare to unfoldable cardinals, however. λ-shrewdness is an improved version of λ-indescribability, as defined in Drake; this cardinal property differs in that the reflected substructure must be (Vα+λ, ∈, A ∩ Vα), making it impossible for a cardinal κ to be κ-indescribable. Also, the monotonicity property is lost: a λ-indescribable cardinal may fail to be α-indescribable for some ordinal α < λ. (en)
gold:hypernym
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 59 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software