Re: Recursive Well-ordering query.
- From: Aatu Koskensilta <aatu.koskensilta@xxxxxxxxx>
- Date: Tue, 27 Sep 2005 19:04:56 +0300
Aatu Koskensilta wrote:
Also, there are many well-orderings (of naturals) which are not p.r. All arithmetical (or hyper-arithmetical) well-orderings are p.r. by a result of Spector, though.
.... which is what Daryl was referring to, given that Bill's original post speaks only about recursive orderings.
-- Aatu Koskensilta (aatu.koskensilta@xxxxxxxxx)
"Wovon man nicht sprechen kann, daruber muss man schweigen" - Ludwig Wittgenstein, Tractatus Logico-Philosophicus .
- References:
- Recursive Well-ordering query.
- From: Bill Taylor
- Re: Recursive Well-ordering query.
- From: Daryl McCullough
- Re: Recursive Well-ordering query.
- From: Aatu Koskensilta
- Recursive Well-ordering query.
- Prev by Date: Re: Recursive Well-ordering query.
- Next by Date: Re: Topology of proof
- Previous by thread: Re: Recursive Well-ordering query.
- Next by thread: Who first called the First Incompleteness Theorem the First Incompleteness Theorem?
- Index(es):
Relevant Pages
|
|
