Tree-automatic well-founded trees

DOI10.1007/978-3-642-30870-3_37MaRDI QIDQ5891703zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Tree-automatic well-founded trees
• The rank of tree-automatic linear orderings
• Model-theoretic complexity of automatic structures
• Model Theoretic Complexity of Automatic Structures (Extended Abstract)
• Automatic linear orders and trees

Cites work

• Automata-based presentations of infinite structures
• Automatic linear orders and trees
• Automatic presentations of structures
• Automatic structures of bounded degree revisited
• Automatic Structures: Richness and Limitations
• Automaticity of ordinals and of homogeneous graphs
• Classification from a Computable Viewpoint
• Computable structures and the hyperarithmetical hierarchy
• Finite presentations of infinite structures: Automata and interpretations
• First-order model checking on generalisations of pushdown graphs.
• scientific article; zbMATH DE number 3767656 (Why is no real title available?)
• scientific article; zbMATH DE number 2047478 (Why is no real title available?)
• Model-theoretic complexity of automatic structures
• Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
• Recurrent Reachability Analysis in Regular Model Checking
• STACS 2005
• The isomorphism problem on classes of automatic structures with transitive relations
• Tree-automatic well-founded trees
• Word automaticity of tree automatic scattered linear orderings is decidable

Cited in

(6)

• The rank of tree-automatic linear orderings
• scientific article; zbMATH DE number 7444022 (Why is no real title available?)
• Pumping for ordinal-automatic structures1
• Tree-automatic well-founded trees
• Tree-automatic well-founded trees
• Hyperarithmetical complexity of infinitary action logic with multiplexing

This page was built for publication: Tree-automatic well-founded trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5891703)