Buchholz's ordinal (original) (raw)
In mathematics, ψ0(Ωω), widely known as Buchholz's ordinal, is a large countable ordinal that is used to measure the proof-theoretic strength of some mathematical systems. In particular, it is the proof theoretic ordinal of the subsystem -CA0 of second-order arithmetic; this is one of the "big five" subsystems studied in reverse mathematics (Simpson 1999). It is also the proof-theoretic ordinal of , the theory of finitely iterated inductive definitions, and of , a fragment of Kripke-Platek set theory extended by an axiom stating every set is contained in an admissible set. Buchholz's ordinal is also the order type of the segment bounded by in Buchholz's ordinal notation . Lastly, it can be expressed as the limit of the sequence: , , , ...
| Property | Value |
|---|---|
| dbo:abstract | In mathematics, ψ0(Ωω), widely known as Buchholz's ordinal, is a large countable ordinal that is used to measure the proof-theoretic strength of some mathematical systems. In particular, it is the proof theoretic ordinal of the subsystem -CA0 of second-order arithmetic; this is one of the "big five" subsystems studied in reverse mathematics (Simpson 1999). It is also the proof-theoretic ordinal of , the theory of finitely iterated inductive definitions, and of , a fragment of Kripke-Platek set theory extended by an axiom stating every set is contained in an admissible set. Buchholz's ordinal is also the order type of the segment bounded by in Buchholz's ordinal notation . Lastly, it can be expressed as the limit of the sequence: , , , ... (en) |
| dbo:wikiPageID | 24632336 (xsd:integer) |
| dbo:wikiPageLength | 2938 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1123337773 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Reverse_mathematics dbc:Proof_theory dbr:Kripke-Platek_set_theory dbr:Ordinal_analysis dbr:Buchholz's_ID_hierarchy dbr:Admissible_set dbr:Large_countable_ordinal dbc:Ordinal_numbers dbr:Second-order_arithmetic dbr:Proof-theoretic_strength |
| dbp:wikiPageUsesTemplate | dbt:Main_article dbt:Isbn dbt:Countable_ordinals dbt:Settheory-stub |
| dct:subject | dbc:Proof_theory dbc:Ordinal_numbers |
| rdfs:comment | In mathematics, ψ0(Ωω), widely known as Buchholz's ordinal, is a large countable ordinal that is used to measure the proof-theoretic strength of some mathematical systems. In particular, it is the proof theoretic ordinal of the subsystem -CA0 of second-order arithmetic; this is one of the "big five" subsystems studied in reverse mathematics (Simpson 1999). It is also the proof-theoretic ordinal of , the theory of finitely iterated inductive definitions, and of , a fragment of Kripke-Platek set theory extended by an axiom stating every set is contained in an admissible set. Buchholz's ordinal is also the order type of the segment bounded by in Buchholz's ordinal notation . Lastly, it can be expressed as the limit of the sequence: , , , ... (en) |
| rdfs:label | Buchholz's ordinal (en) |
| owl:sameAs | wikidata:Buchholz's ordinal https://global.dbpedia.org/id/4y8Fa |
| prov:wasDerivedFrom | wikipedia-en:Buchholz's_ordinal?oldid=1123337773&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Buchholz's_ordinal |
| is dbo:wikiPageRedirects of | dbr:Ψ0(Ωω) dbr:Ψ₀(Ωω) dbr:Buchholz_ordinal dbr:Psi0(Omega_omega) |
| is dbo:wikiPageWikiLink of | dbr:Ψ0(Ωω) dbr:Ψ₀(Ωω) dbr:Ordinal_collapsing_function dbr:Buchholz_hydra dbr:Buchholz_ordinal dbr:Psi0(Omega_omega) |
| is foaf:primaryTopic of | wikipedia-en:Buchholz's_ordinal |