Jump to content

Talk:Ordinal collapsing function

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Stephen J. Brooks (talk | contribs) at 16:10, 30 July 2021 (Beyond \Gamma_0: new section). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics C‑class Low‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
CThis article has been rated as C-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-priority on the project's priority scale.

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)[reply]

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)[reply]

Greetings. I am the author. FLeℵgyel (ta|k) —Preceding undated comment added 23:29, 17 November 2013 (UTC)[reply]

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)[reply]

If you check the definition of C0+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)[reply]
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)[reply]

Beyond

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

--Stephen J. Brooks (talk) 16:10, 30 July 2021 (UTC)[reply]