To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Buchholz's ordinal

From Wikipedia, the free encyclopedia

In mathematics, ψ0ω), widely known as Buchholz's ordinal[citation needed], 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;[1][2] 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 ,[3] 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 .[1] Lastly, it can be expressed as the limit of the sequence: , , , ...

YouTube Encyclopedic

  • 1/3
    Views:
    1 724
    543
    1 181
  • Another Math of Infinity: Ordinals and "going past infinity"
  • Online calculator for fast-growing hierarchy with Extended Buchholz Function: Examples of work
  • The Practical Empire of Infinite Hotels: A math thought experiment

Transcription

Definition

  • , and for n > 0.
  • is the closure of under addition and the function itself (the latter of which only for and ).
  • is the smallest ordinal not in .
  • Thus, ψ0ω) is the smallest ordinal not in the closure of under addition and the function itself (the latter of which only for and ).

References

  1. ^ a b Buchholz, W. (1986-01-01). "A new system of proof-theoretic ordinal functions". Annals of Pure and Applied Logic. 32: 195–207. doi:10.1016/0168-0072(86)90052-7. ISSN 0168-0072.
  2. ^ Simpson, Stephen G. (2009). Subsystems of Second Order Arithmetic. Perspectives in Logic (2 ed.). Cambridge: Cambridge University Press. ISBN 978-0-521-88439-6.
  3. ^ T. Carlson, "Elementary Patterns of Resemblance" (1999). Accessed 12 August 2022.


This page was last edited on 7 February 2024, at 05:49
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.