arXiv 2203.077302022-03-15math.LOmath.GR

可计算悖论分解

Computable paradoxical decompositions

Karol Duda, Aleksander Ivanov

备注：: Overlap with Sections 6-8 of arXiv:1904.02640. To be published in International Journal of Algebra and Computation

摘要：

我们证明了一个可计算版本的霍尔的哈伦定理，并将其应用到可计算版本的塔斯基的选择定理。

We prove a computable version of Hall's Harem Theorem and apply it to computable versions of Tarski's alternative theorem.

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