Note on a proof of the extended Kirby-Paris theorem on labelled finite trees (Q1110524): Difference between revisions

The author gives a new proof that a certain game on labelled finite trees whose nodes have labels from \(\{\) 0,1,...,\(\omega\) \(\}\) stops in finite time. The new proof avoids the use of any infinitary notion.