Tree-Automatic Well-Founded Trees
We investigate tree-automatic well-founded trees. Using Delhomme's decomposition technique for tree-automatic structures, we show that the (ordinal) rank of a tree-automatic well-founded tree is strictly below omega^omega. Moreover, we make a step towards proving that the ranks of tree-automatic wel...
I tiakina i:
| Ngā kaituhi matua: | , , , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Logical Methods in Computer Science e.V.
2013-06-01
|
| Rangatū: | Logical Methods in Computer Science |
| Ngā marau: | |
| Urunga tuihono: | https://lmcs.episciences.org/721/pdf |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|