关于Tarski可判定性问题
On Tarski's Decidability Problem
摘要：
本说明提供了一个简要的指南，以目前的状态的文献塔斯基的问题，重点是功能区分的方法的基础上组合和算法的群论从拓扑方法塔斯基的问题。我们使用这份说明来纠正一些错别字，并解决Z。Sela讨论了Tarski问题方法中概念与结果之间的关系.我们被迫阅读塞拉的论文，以便能够解决他的一些评论，并在他发表在GAFA和Israel J. Math.上的关于丢番图几何的论文6、3和4中发现了错误。我们在第4节中提到。他的ICM 2002论文集也包含错误的定理6（为了使其正确，必须改变非初等双曲$ω$ -剩余自由塔的定义，使其等价于我们的常规NTQ系统的坐标群。
英文摘要：
This note provides a brief guide to the current state of the literature on Tarski's problems with emphasis on features that distinguish the approach based on combinatorial and algorithmic group theory from the topological approach to Tarski's problem. We use this note to provide corrections to some typos and to address some misconceptions from the recent report by Z. Sela about the relations between the concepts and results in the approaches to the Tarski problems. We were forced to read Sela's papers to be able to address some of his comments, and found errors in his papers 6, 3 and 4 on Diophantine Geometry published in GAFA and Israel J. Math. which we mention in Section 4. His proceedings of the ICM 2002 paper also contains wrong Theorem 6 (to make it correct one has to change the definition of non-elementary hyperbolic $ω$-residually free towers to make them equivalent to our coordinate groups of regular NTQ systems.)
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
