On the logical strength of Nash-Williams' theorem on transfinite sequences

Details On the logical strength of Nash-Williams' theorem on transfinite sequences On the logical strength of Nash-Williams' theorem on transfinite sequences

1994-08-30

arxiv.org/abs/math/9408204v1

in: Logic: from Foundations to Applications; European logic colloquium (W.Hodges, M.Hyland, C.Steinhorn, J.Truss, eds), Claren

Mathematics

Logic

Scientific paper

We show that Nash-Williams' theorem asserting that the countable transfinite sequences of elements of a better-quasi-ordering ordered by embeddability form a better-quasi-ordering is provable in the subsystem of second order arithmetic Pi^1_1-CA_0 but is not equivalent to Pi^1_1-CA_0. We obtain some partial results towards the proof of this theorem in the weaker subsystem ATR_0 and we show that the minimality lemmas typical of wqo and bqo theory imply Pi^1_1-CA_0 and hence cannot be used in such a proof.

Affiliated with

Also associated with

No associations

Rating

On the logical strength of Nash-Williams' theorem on transfinite sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the logical strength of Nash-Williams' theorem on transfinite sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the logical strength of Nash-Williams' theorem on transfinite sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-523577