arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1505.07578cs.DMcs.LOmath.RA
收藏

闭包空间中的枚举约简及其在逻辑和代数中的应用

Enumeration Reducibility in Closure Spaces with Applications to Logic and Algebra

Emmanuel Jeandel

摘要:

在一阶逻辑或可计算代数的许多实例中,经典定理表明,许多问题对于一般结构是不可判定的,但如果结构上施加一定的刚性,则变得可判定。例如,许多可公理化理论的定理集是非递归的,但任何可公理化完备理论的定理集是递归的。显式群可能有非递归的单词问题,但显式单群有递归的单词问题。在这篇文章中,我们介绍了一个拓扑框架的基础上关闭空间,以表明,许多这些证明可以在类似的设置。我们将特别表明,这些语句可以推广到覆盖任意结构,没有有限或递归的表示/公理化。这特别概括了库兹涅佐夫和其他人的工作。一阶逻辑和符号动力学的例子将详细讨论。

英文摘要:

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of theorems in many finitely axiomatisable theories is nonrecursive, but the set of theorems for any finitely axiomatisable complete theory is recursive. Finitely presented groups might have an nonrecursive word problem, but finitely presented simple groups have a recursive word problem. In this article we introduce a topological framework based on closure spaces to show that many of these proofs can be obtained in a similar setting. We will show in particular that these statements can be generalized to cover arbitrary structures, with no finite or recursive presentation/axiomatization. This generalizes in particular work by Kuznetsov and others. Examples from first order logic and symbolic dynamics will be discussed at length.

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

↑