A hierarchy of tree-automatic structures

DOI10.2178/jsl/1327068708zbMath1241.03041arXiv1111.1504OpenAlexW2962743408MaRDI QIDQ5388735

Stevo Todorčević, Olivier Finkel

Publication date: 19 April 2012

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.1504

zbMATH Keywords

independence resultsmodels of set theory\(\omega \)-tree-automatic structuresisomorphism relation\(\omega ^{n}\)-automatic structuresautomata reading ordinal words

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Consistency and independence results (03E35) Continuum hypothesis and Martin's axiom (03E50) Computable structure theory, computable model theory (03C57)

Related Items

Tree-automatic scattered linear orders, Pumping for ordinal-automatic structures1, Deciding Parity Games in Quasi-polynomial Time, The isomorphism problem for tree-automatic ordinals with addition

Cites Work

• All automorphisms of the Calkin algebra are inner
• The isomorphism relation between tree-automatic structures
• The monadic second order theory of all countable ordinals
• The model theory of unitriangular groups
• Finite automata and ordinals
• Logic over words on denumerable ordinals
• Finite presentations of infinite structures: Automata and interpretations
• Automata, logics, and infinite games. A guide to current research
• Is Ramsey's theorem omega-automatic?
• Automata Presenting Structures: A Survey of the Finite String Case
• Describing Groups
• The Isomorphism Problem for ω-Automatic Trees
• Compacts de fonctions mesurables et filtres non mesurables
• A Modification of Shelah's Oracle-C.C. with Applications
• Partition Problems in Topology
• Luzin gaps
• Analytic quotients: theory of liftings for quotients over analytic ideals on the integers
• New Radon–Nikodym ideals
• STACS 2004
• Automatic Structures: Richness and Limitations
• First-order and counting theories ofω-automatic structures
• On Countable Indecomposable Order Types
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Locally finite languages
• Computer science and the fine structure of Borel sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item