Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Ordinal_collapsing_function> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items per page.
- Ordinal_collapsing_function abstract "In mathematical logic and set theory, an ordinal collapsing function (or projection function) is a technique for defining (notations for) certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger than the one being defined, perhaps even large cardinals (though they can be replaced with recursively large ordinals at the cost of extra technical difficulty), and then “collapse” them down to a system of notations for the sought-after ordinal. For this reason, ordinal collapsing functions are described as an impredicative manner of naming ordinals.The details of the definition of ordinal collapsing functions vary, and get more complicated as greater ordinals are being defined, but the typical idea is that whenever the notation system “runs out of fuel” and cannot name a certain ordinal, a much larger ordinal is brought “from above” to give a name to that critical point. An example of how this works will be detailed below, for an ordinal collapsing function defining the Bachmann-Howard ordinal (i.e., defining a system of notations up to the Bachmann-Howard ordinal).The use and definition of ordinal collapsing functions is inextricably intertwined with the theory of ordinal analysis, since the large countable ordinals defined and denoted by a given collapse are used to describe the ordinal-theoretic strength of certain formal systems, typically subsystems of analysis (such as those seen in the light of reverse mathematics), extensions of Kripke-Platek set theory, Bishop-style systems of constructive mathematics or Martin-Löf-style systems of intuitionistic type theory.Ordinal collapsing functions are typically denoted using some variation of the Greek letter (psi).".
- Ordinal_collapsing_function wikiPageExternalLink 0104-004.ps.
- Ordinal_collapsing_function wikiPageExternalLink rathjen4.pdf.
- Ordinal_collapsing_function wikiPageExternalLink NSTAB.ps.
- Ordinal_collapsing_function wikiPageExternalLink ehab.pdf.
- Ordinal_collapsing_function wikiPageID "16968563".
- Ordinal_collapsing_function wikiPageRevisionID "581493134".
- Ordinal_collapsing_function hasPhotoCollection Ordinal_collapsing_function.
- Ordinal_collapsing_function subject Category:Ordinal_numbers.
- Ordinal_collapsing_function type Abstraction100002137.
- Ordinal_collapsing_function type DefiniteQuantity113576101.
- Ordinal_collapsing_function type Measure100033615.
- Ordinal_collapsing_function type Number113582013.
- Ordinal_collapsing_function type OrdinalNumber113597280.
- Ordinal_collapsing_function type OrdinalNumbers.
- Ordinal_collapsing_function comment "In mathematical logic and set theory, an ordinal collapsing function (or projection function) is a technique for defining (notations for) certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger than the one being defined, perhaps even large cardinals (though they can be replaced with recursively large ordinals at the cost of extra technical difficulty), and then “collapse” them down to a system of notations for the sought-after ordinal.".
- Ordinal_collapsing_function label "Ordinal collapsing function".
- Ordinal_collapsing_function sameAs m.0413sth.
- Ordinal_collapsing_function sameAs Q7100784.
- Ordinal_collapsing_function sameAs Q7100784.
- Ordinal_collapsing_function sameAs Ordinal_collapsing_function.
- Ordinal_collapsing_function wasDerivedFrom Ordinal_collapsing_function?oldid=581493134.
- Ordinal_collapsing_function isPrimaryTopicOf Ordinal_collapsing_function.