Tree-Automatic Well-Founded Trees

DOI10.1007/978-3-642-30870-3_37zbMath1358.03042OpenAlexW1530071891MaRDI QIDQ5891703

Alexander Kartzow, Jiamou Liu, Markus Lohrey

Publication date: 14 August 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30870-3_37

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Related Items (2)

Pumping for ordinal-automatic structures1 ⋮ Tree-Automatic Well-Founded Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model-theoretic complexity of automatic structures
• Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
• Computable structures and the hyperarithmetical hierarchy
• Finite presentations of infinite structures: Automata and interpretations
• Automaticity of ordinals and of homogeneous graphs
• The isomorphism problem on classes of automatic structures with transitive relations
• Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable
• Automatic structures of bounded degree revisited
• First-Order Model Checking on Generalisations of Pushdown Graphs
• Classification from a Computable Viewpoint
• Automatic linear orders and trees
• Automatic Structures: Richness and Limitations
• Recurrent Reachability Analysis in Regular Model Checking
• STACS 2005
• Tree-Automatic Well-Founded Trees
• Automatic presentations of structures

This page was built for publication: Tree-Automatic Well-Founded Trees