The isomorphism relation between tree-automatic structures
From MaRDI portal
Publication:707994
DOI10.2478/s11533-010-0014-7zbMath1207.03050arXiv1007.0822OpenAlexW3103414753MaRDI QIDQ707994
Stevo Todorčević, Olivier Finkel
Publication date: 8 October 2010
Published in: Central European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.0822
Boolean algebrasrelational structuretree automataindependence resultsisomorphism problempartial ordersmodels of set theory\(\omega \)-tree-automatic structures
Descriptive set theory (03E15) Automata and formal grammars in connection with logical questions (03D05) Models of arithmetic and set theory (03C62) Properties of classes of models (03C52)
Related Items
Deciding Parity Games in Quasi-polynomial Time, A hierarchy of tree-automatic structures, Unnamed Item
Cites Work
- Descriptive set theory
- The model theory of unitriangular groups
- Finite presentations of infinite structures: Automata and interpretations
- Automaticity of ordinals and of homogeneous graphs
- Automata Presenting Structures: A Survey of the Finite String Case
- Describing Groups
- On Certain Boolean Algebras P(ω)/I
- Partition Problems in Topology
- Analytic quotients: theory of liftings for quotients over analytic ideals on the integers
- Set Theory
- Automatic Structures: Richness and Limitations
- First-order and counting theories ofω-automatic structures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item