Tree-Automatic Well-Founded Trees

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-automati...

Full description

Bibliographic Details
Main Authors: Martin Huschenbett, Alexander Kartzow, Jiamou Liu, Markus Lohrey
Format: Article
Language:English
Published: Logical Methods in Computer Science e.V. 2013-06-01
Series:Logical Methods in Computer Science
Subjects:
computer science - logic in computer science
mathematics - logic
Online Access:https://lmcs.episciences.org/721/pdf

Similar Items

Similar Items