Note on a proof of the extended Kirby-Paris theorem on labelled finite trees (Q1110524)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Note on a proof of the extended Kirby-Paris theorem on labelled finite trees |
scientific article; zbMATH DE number 4072989
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on a proof of the extended Kirby-Paris theorem on labelled finite trees |
scientific article; zbMATH DE number 4072989 |
Statements
Note on a proof of the extended Kirby-Paris theorem on labelled finite trees (English)
0 references
1988
0 references
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.
0 references
games on trees
0 references
labelled finite trees
0 references
0 references
0 references
