Ψ₀(Ωω)
In mathematics, Ψ0(Ωω) 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).
Definition
- , and for n > 0.
- is the smallest set of ordinals that contains for n finite, and contains all ordinals less than , and is closed under ordinal addition and exponentiation, and contains if j ≥ i and and .
- is the smallest ordinal not in
gollark: You also are probably not running Haskell with its giant runtime on a microcontroller doing those things.
gollark: My friend likes Haskell but also spends time reading incomprehensible papers on logic and type theory and such.
gollark: Possibly. People *allegedly* use them for real world applications occasionally.
gollark: Degree?
gollark: `let 2 + 2 = 5 in 2 + 2` is totally valid (but undefined for anything but `2 + 2`).
References
- G. Takeuti, Proof theory, 2nd edition 1987 ISBN 0-444-10492-5
- K. Schütte, Proof theory, Springer 1977 ISBN 0-387-07911-4
- Simpson, Stephen G. (2009), Subsystems of second order arithmetic, Perspectives in Logic (2nd ed.), Cambridge University Press, ISBN 978-0-521-88439-6, MR 2517689
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.