Pumping for ordinal-automatic structures1

DOI10.3233/COM-160057zbMath1420.03088MaRDI QIDQ5283444

Martin Huschenbett, Alexander Kartzow, Philipp Schlicht

Publication date: 21 July 2017

Published in: Computability (Search for Journal in Brave)

zbMATH Keywords

pumping lemmaclassification of Boolean algebrasorder forestsordinal-automatic structures

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Structure theory of Boolean algebras (06E05) Properties of classes of models (03C52) Computable structure theory, computable model theory (03C57) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

Tree-automatic scattered linear orders ⋮ Space-bounded OTMs and REG ∞

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model-theoretic complexity of automatic structures
• Automaticity of ordinals and of homogeneous graphs
• Automata on ordinals and automaticity of linear orders
• The isomorphism problem on classes of automatic structures with transitive relations
• The Rank of Tree-Automatic Linear Orderings
• Finite state automata and monadic definability of singular cardinals
• Term Rewriting and All That
• Automatic linear orders and trees
• Automatic Structures: Richness and Limitations
• Structures without Scattered-Automatic Presentation
• A hierarchy of tree-automatic structures
• Decision methods in the theory of ordinals
• Tree-Automatic Well-Founded Trees
• Automata theory and its applications

This page was built for publication: Pumping for ordinal-automatic structures1