Talk:Ordinal collapsing function
![]() | Mathematics C‑class Low‑priority | |||||||||
|
wall street
I think this is a joke: http://science.slashdot.org/story/10/05/27/0258245/Sudden-Demand-For-Logicians-On-Wall-Street
- "In an unexpected development for the depressed market for mathematical logicians, Wall Street has begun quietly and aggressively recruiting proof theorists and recursion theorists for their expertise in applying ordinal notations and ordinal collapsing functions to high-frequency algorithmic trading...."
69.228.170.24 (talk) 06:04, 27 May 2010 (UTC)
Yes, all my sources assure me it's a joke, and nobody has stepped up to provide evidence that infinite ordinals are used in high-frequency trading. John Baez (talk) 21:04, 24 November 2012 (UTC)
Greetings. I am the author. FLeℵgyel (ta|k) —Preceding undated comment added 23:29, 17 November 2013 (UTC)
question on the section: predicative part
It is written
"Now but is no larger, since cannot be constructed using finite applications of and thus never belongs to a set for , and the function remains “stuck” at "
but should not be an element of since we have and ? If this is correct should be larger than — Preceding unsigned comment added by 88.131.62.36 (talk) 11:14, 15 June 2013 (UTC)
- If you check the definition of C(ζ0+1), you will see that you would have to show that ζ0 belongs to it (for some other reason) in addition to ζ0 < ζ0+1 before you can conclude that ζ0 belongs to it on account of being ψ(ζ0). JRSpriggs (talk) 11:01, 16 June 2013 (UTC)
- I was also initially confused about the values of ψ, but I understand it now. "ψ(α) is the smallest ordinal which cannot be expressed from 0, 1, ω and Ω using sums, products, exponentials, and the ψ function itself (to previously constructed ordinals less than α)." The key part is "previously constructed"; I need to be able to create the ordinal number in a finite number of steps from {0, 1, ω, Ω} before I can apply the ψ function to it. Since ζ0 cannot be constructed in a finite number of steps from {0, 1, ω}, the only way it can be generated is as ψ(Ω); and by definition, ψ(Ω) is not a member of any constructed sets before C(Ω+1). - Mike Rosoft (talk) 05:43, 22 August 2014 (UTC)
Beyond (section: Beyond the Feferman–Schütte ordinal)
There is a statement that:
...but I guess this would need a reference where someone has worked out the correspondence between the collapsing function and the Veblen functions to this level, because I'm trying to work out the same thing and getting a different answer.
Before you get to , or even , you have to take the limit of , which should equal .
Before even that you have to get to , which is presumably the supremum of for .
To my reasoning, it should be something like
and specifically, and
I think this line of reasoning would also give
and for , .
It would eventually agree with the rest of the article at .