arXiv 1007.08222010-07-06math.LOcs.LO

The Isomorphism Relation Between Tree-Automatic Structures

Olivier Finkel, Stevo Todorcevic

发表信息：: Central European Journal of Mathematics 8, 2 (2010) p. 299-313
DOI：: 10.2478/s11533-010-0014-7

英文摘要：

An $ω$-tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism problem for $ω$-tree-automatic structures. We prove first that the isomorphism relation for $ω$-tree-automatic boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups, nilpotent groups of class n >1) is not determined by the axiomatic system ZFC. Then we prove that the isomorphism problem for $ω$-tree-automatic boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups, nilpotent groups of class n >1) is neither a $Σ_2^1$-set nor a $Π_2^1$-set.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Club isomorphisms on higher Aronszajn trees

We prove the consistency, assuming an ineffable cardinal, that any two normal countably closed $ω_2$-Aronszajn trees are club isomorphic. This work generalizes to higher cardinals the property of Abraham-Shelah that any two normal $ω_1$-Aronszajn trees are club isomorphic, which follows from $\textsf{PFA}$. The statement that any two normal countably closed $ω_2$-Aronszajn trees are club isomorphic implies that there are no $ω_2$-Suslin trees, so our proof also expands on the method of Laver-Shelah for obtaining the $ω_2$-Suslin hypothesis.

2018-06-02math.LO

Potential isomorphism and semi-proper trees

We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the cardinality of the models. We introduce the notions of semi-proper and weakly semi-proper trees, and note that there is a strong connection between the existence of potentially isomorphic models for a given complete theory and the existence of weakly semi-proper trees. We prove the existence of semi-proper trees under certain cardinal arithmetic assumptions. W…

2001-12-27math.LO

Suslin树的保持与闭无界同构

Suslin tree preservation and club isomorphisms

本文构造了存在Suslin树且特定正规Aronszajn树闭无界同构的集合论模型，还证明自由正规Suslin树经c.c.c.力迫可实现n-自由且高维导出树特殊的结果。

2022-12-17math.LO

The isomorphism problem for tree-automatic ordinals with addition

This paper studies tree-automatic ordinals (or equivalently, well-founded linearly ordered sets) together with the ordinal addition operation +. Informally, these are ordinals such that their elements are coded by finite trees for which the linear order relation of the ordinal and the ordinal addition operation can be determined by tree automata. We describe an algorithm that, given two tree-automatic ordinals with the ordinal addition operation, decides if the ordinals are isomorphic.

2019-03-20cs.FLmath.LO

Tree-Automatic Well-Founded Trees

We investigate tree-automatic well-founded trees. Using Delhomme's decomposition technique for tree-automatic structures, we show that the (ordinal) rank of a tree-automatic well-founded tree is strictly below omega^omega. Moreover, we make a step towards proving that the ranks of tree-automatic well-founded partial orders are bounded by omega^omega^omega: we prove this bound for what we call upwards linear partial orders. As an application of our result, we show that the isomorphism problem for tree-automatic well-founded trees is complete for level Delta^0_{omega^omega} of the hyperarithmeti…

2013-06-24cs.LOmath.LO

The Rank of Tree-Automatic Linear Orderings

We generalise Delhommé's result that each tree-automatic ordinal is strictly below ω^ω^ω by showing that any tree-automatic linear ordering has FC-rank strictly below ω^ω. We further investigate a restricted form of tree-automaticity and prove that every linear ordering which admits a tree-automatic presentation of branching complexity at most k has FC-rank strictly below ω^k.

2012-04-13cs.LOmath.LO

更多相关论文收起更多论文

A Hierarchy of Tree-Automatic Structures

We consider $ω^n$-automatic structures which are relational structures whose domain and relations are accepted by automata reading ordinal words of length $ω^n$ for some integer $n\geq 1$. We show that all these structures are $ω$-tree-automatic structures presentable by Muller or Rabin tree automata. We prove that the isomorphism relation for $ω^2$-automatic (resp. $ω^n$-automatic for $n>2$) boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups) is not determined by the axiomatic system ZFC. We infer from the proof of the above…

2011-11-07cs.LOmath.LO

Collapsible Pushdown Graphs of Level 2 are Tree-Automatic

We show that graphs generated by collapsible pushdown systems of level 2 are tree-automatic. Even if we allow epsilon-contractions and reachability predicates (with regular constraints) for pairs of configurations, the structures remain tree-automatic whence their first-order logic theories are decidable. As a corollary we obtain the tree-automaticity of the second level of the Caucal-hierarchy.

2013-03-18cs.FLcs.LOmath.LO

有限生成群中阿基米德序的同构关系的Borel复杂度

Borel Complexity of the Isomorphism Relation of Archimedean Orders in Finitely Generated Groups

本文证明了有限生成群中阿基米德序的同构关系的Borel复杂度，具体回答了Calderoni等人提出的问题，表明在$n\geq3$时非超有限，在$n\geq4$时非可树化。

2024-03-17math.DSmath.GRmath.LO

Collapsible Pushdown Graphs of Level 2 are Tree-Automatic

We show that graphs generated by collapsible pushdown systems of level 2 are tree-automatic. Even when we allow $ε$-contractions and add a reachability predicate (with regular constraints) for pairs of configurations, the structures remain tree-automatic. Hence, their FO theories are decidable, even when expanded by a reachability predicate. As a corollary, we obtain the tree-automaticity of the second level of the Caucal-hierarchy.

2010-02-03math.LO

Isomorphism and classification for countable structures

We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and computable structure theory, extending concepts from the latter beyond computable structures to examine the isomorphism problem on arbitrary countable structures. We give examples using specific classes of fields and of trees, illustrating how the new concepts can yield classifications that reveal differences between seemingly similar classes. Finally, we u…

2018-07-19math.LO

Approximate Isomorphism of Metric Structures

We give a formalism for approximate isomorphism in continuous logic simultaneously generalizing those of two papers by Ben Yaacov and by Ben Yaacov, Doucha, Nies, and Tsankov, which are largely incompatible. With this we explicitly exhibit Scott sentences for the perturbation systems of the former paper, such as the Banach-Mazur distance and the Lipschitz distance between metric spaces. Our formalism is simultaneously characterized syntactically by a mild generalization of perturbation systems and semantically by certain elementary classes of two-sorted structures that witness approximate isom…

2022-12-29math.LO

Three Lectures on Automatic Structures

This paper grew out of three tutorial lectures on automatic structures given by the first author at the Logic Colloquium 2007. We discuss variants of automatic structures related to several models of computation: word automata, tree automata, Buchi automata, and Rabin automata. Word automata process finite strings, tree automata process finite labeled trees, Buchi automata process infinite strings, and Rabin automata process infinite binary labeled trees. Automatic structures are mathematical objects which can be represented by (word, tree, Buchi, or Rabin) automata. The study of properties of…

2008-09-19math.LO

Changing the Heights of Automorphism Towers by Forcing with Souslin Trees over L

We prove that there are groups in the constructible universe whose automorphism towers are highly malleable by forcing. This is a consequence of the fact that, under a suitable diamond hypothesis, there are sufficiently many highly rigid non-isomorphic Souslin trees whose isomorphism relation can be precisely controlled by forcing.

2007-02-26math.GRmath.LO

论GDST中的非超稳定理论

On unsuperstable theories in GDST

本文在GDST框架下用着色树研究一阶理论同构关系的$κ$-Borel归约，证明在适当基数假设下，非超稳定理论的模型同构严格高于可分类理论的模型同构。

2022-03-27math.LO

约化积之间的平凡同构

Trivial Isomorphisms between Reduced Products

本文提出在弱力迫公理下证明可数模型约化积自同构极小化的通用方法，并推出域、序、树、随机图及 P(N)/Fin 的自同构均平凡。

2024-10-28math.LO

Structures Without Scattered-Automatic Presentation

Bruyere and Carton lifted the notion of finite automata reading infinite words to finite automata reading words with shape an arbitrary linear order L. Automata on finite words can be used to represent infinite structures, the so-called word-automatic structures. Analogously, for a linear order L there is the class of L-automatic structures. In this paper we prove the following limitations on the class of L-automatic structures for a fixed L of finite condensation rank 1+α. Firstly, no scattered linear order with finite condensation rank above ω^(α+1) is L-α-automatic. In particular, every L-a…

2013-04-03cs.FLmath.LO