Tree-Automatic Well-Founded Trees

@article{Huschenbett2013TreeAutomaticWT,
  title={Tree-Automatic Well-Founded Trees},
  author={Martin Huschenbett and Alexander Kartzow and J. Liu and M. Lohrey},
  journal={Log. Methods Comput. Sci.},
  year={2013},
  volume={9}
}
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 well-founded partial orders are bounded by omega^omega^omega: we prove this bound for what we call upwards linear partial orders. As an application of our result, we show that the isomorphism problem… Expand
3 Citations
Tree-Automatic Well-Founded Trees
The Rank of Tree-Automatic Linear Orderings
Structures without Scattered-Automatic Presentation

References

SHOWING 1-10 OF 37 REFERENCES
Tree-Automatic Well-Founded Trees
Automatic linear orders and trees
Model-theoretic complexity of automatic structures
Automatic structures
  • Achim Blumensath, E. Grädel
  • Computer Science
  • Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)
  • 2000
Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable
The isomorphism problem on classes of automatic structures with transitive relations
Finite Presentations of Infinite Structures: Automata and Interpretations
First-Order Model Checking on Generalisations of Pushdown Graphs
Computable structures and the hyperarithmetical hierarchy
Automatic structures: richness and limitations
...
1
2
3
4
...