Note on a proof of the extended Kirby-Paris theorem on labelled finite trees (Q1110524): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q210450 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Peter Kirschenhofer / rank | |||
Normal rank | |||
Revision as of 06:40, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on a proof of the extended Kirby-Paris theorem on labelled finite trees |
scientific article |
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
