首页/论文/0801.2097

arXiv 0801.20972008-01-14math.LO

The Recursion Theorem and Infinite Sequences

Arnold W. Miller

英文摘要：

In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove that there exists an increasing sequence such that W_{e_n}={e_{n+1},e_{n+2},...} for every n. We call a nonempty computably enumerable set A self-constructing if W_e=A for every e in A. We show that every nonempty computable enumerable set which is disjoint from an infinite computable set is one-one equivalent to a self-constructing set

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

高阶类型 ITTM-递归与无限博弈的决定性

Higher Type ITTM-recursion and Determinacy of Infinite Games

University of Bristol（布里斯托大学）

本文发展了无限时间图灵机的高阶类型递归理论，证明了其停机问题的复杂度等价于完全的 $\Game \Sigma^0_3$ 集，并刻画了不可递归的最小序数。

2026-06-24math.LO

Generalizations of the Recursion Theorem

We consider two generalizations of the recursion theorem, namely Visser's ADN theorem and Arslanov's completeness criterion, and we prove a joint generalization of these theorems.

2018-05-03cs.LOmath.LO

A Direct Proof of Schwichtenberg's Bar Recursion Closure Theorem

In 1979 Schwichtenberg showed that the System $\text{T}$ definable functionals are closed under a rule-like version Spector's bar recursion of lowest type levels $0$ and $1$. More precisely, if the functional $Y$ which controls the stopping condition of Spector's bar recursor is $\text{T}$-definable, then the corresponding bar recursion of type levels $0$ and $1$ is already $\text{T}$-definable. Schwichtenberg's original proof, however, relies on a detour through Tait's infinitary terms and the correspondence between ordinal recursion for $α< \varepsilon_0$ and primitive recursion over finite …

2017-08-15math.LO

The noneffectivity of Arslanov's completeness criterion and related theorems

We discuss the (non)effectivity of Arslanov's completeness criterion. In particular, we show that a parameterized version, similar to the recursion theorem with parameters, fails. We also discuss the parameterized version of another extension of the recursion theorem, namely Visser's ADN theorem.

2018-04-04math.LO

Kolmogorov complexity and the Recursion Theorem

Several classes of DNR functions are characterized in terms of Kolmogorov complexity. In particular, a set of natural numbers A can wtt-compute a DNR function iff there is a nontrivial recursive lower bound on the Kolmogorov complexity of the initial segments of A. Furthermore, A can Turing compute a DNR function iff there is a nontrivial A-recursive lower bound on the Kolmogorov complexity of the initial segements of A. A is PA-complete, that is, A can compute a {0,1}-valued DNR function, iff A can compute a function F such that F(n) is a string of length n and maximal C-complexity among the …

2014-08-10math.LO

An inside/outside Ramsey theorem and recursion theory

Inspired by Ramsey's theorem for pairs, Rival and Sands proved what we refer to as an inside/outside Ramsey theorem: every infinite graph $G$ contains an infinite subset $H$ such that every vertex of $G$ is adjacent to precisely none, one, or infinitely many vertices of $H$. We analyze the Rival-Sands theorem from the perspective of reverse mathematics and the Weihrauch degrees. In reverse mathematics, we find that the Rival-Sands theorem is equivalent to arithmetical comprehension and hence is stronger than Ramsey's theorem for pairs. We also identify a weak form of the Rival-Sands theorem th…

2021-09-16math.LO

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

Proving Termination of Unfolding Graph Rewriting for General Safe Recursion

In this paper we present a new termination proof and complexity analysis of unfolding graph rewriting which is a specific kind of infinite graph rewriting expressing the general form of safe recursion. We introduce a termination order over sequences of terms together with an interpretation of term graphs into sequences of terms. Unfolding graph rewrite rules expressing general safe recursion can be successfully embedded into the termination order by the interpretation, yielding the polynomial runtime complexity. Moreover, generalising the definition of unfolding graph rewrite rules for general…

2014-06-20cs.CCcs.LOmath.LO

算术超限递归之上的搜索问题

Searching problems above arithmetical transfinite recursion

本文研究算术超限递归之上介于 ATR₂ 与 C_{ω^ω} 之间的 Weihrauch 问题，证明康托空间单调算子不动点定理不可归约到 ATR₂，并引入 ω-模型反射 ATR₂^rfn 作为一类算术形式问题的上界，同时给出相对化最小不动点定理的线性层级。

2024-06-08math.LO

The exact strength of the class forcing theorem

The class forcing theorem, which asserts that every class forcing notion $\mathbb{P}$ admits a forcing relation $\Vdash_{\mathbb{P}}$, that is, a relation satisfying the forcing relation recursion -- it follows that statements true in the corresponding forcing extensions are forced and forced statements are true -- is equivalent over Gödel-Bernays set theory GBC to the principle of elementary transfinite recursion $\text{ETR}_{\text{Ord}}$ for class recursions of length $\text{Ord}$. It is also equivalent to the existence of truth predicates for the infinitary languages $\mathcal{L}_{\text{Ord…

2021-03-10math.LO

Recursion categories of coalgebras

We construct recursion categories from categories of coalgebras. Let $F$ be a nontrivial endofunctor on the category of sets that weakly preserves pullbacks and such that the category $\textbf{Set}_F$ of $F$-coalgebras is complete. The category $\textbf{Set}_F$ may be embedded in the category $\mathbf{Pfn}_F$ of $F$-coalgebras and partial morphisms, which is a $P$-category that is prodominical but not dominical in general. An existence theorem of A. Heller is applied to certain subcategories of $\textbf{Pfn}_F$ to obtain examples of recursion categories of coalgebras.

2001-05-31math.CTmath.LO

An isomorphism theorem for models of Weak König's Lemma without primitive recursion

We prove that if $(M,\mathcal{X})$ and $(M,\mathcal{Y})$ are countable models of the theory $\mathrm{WKL}^*_0$ such that $\mathrm{I}Σ_1(A)$ fails for some $A \in \mathcal{X} \cap \mathcal{Y}$, then $(M,\mathcal{X})$ and $(M,\mathcal{Y})$ are isomorphic. As a consequence, the analytic hierarchy collapses to $Δ^1_1$ provably in $\mathrm{WKL}^*_0 + \neg\mathrm{I}Σ^0_1$, and $\mathrm{WKL}$ is the strongest $Π^1_2$ statement that is $Π^1_1$-conservative over $\mathrm{RCA}^*_0 + \neg\mathrm{I}Σ^0_1$. Applying our results to the $Δ^0_n$-definable sets in models of $\mathrm{RCA}^*_0 + \mathrm{B}Σ^0_n …

2022-08-27math.LO

利用Kleene第二递归定理引导双向远程证明

Bootstrapping Mutual Attestation with Kleene's Second Recursion Theorem

Confidential Computing Lab Acompany Co., Ltd.（Acompany公司保密计算实验室）

该研究针对无中心可信方的双向远程证明参考值引导问题，将其转化为不动点方程，利用Kleene第二递归定理提出架构无关方案，开发PyReflect和NixReflect实现原型，无需TTP或外部参考值即可完成证明。

2026-10-01cs.CRmath.LO