关于算术度和超算术度的$Σ_2$理论作为上半格的可判定性
On the decidability of the $Σ_2$ theories of the arithmetic and hyperarithmetic degrees as uppersemilattices
摘要:
我们建立了上半格语言中算术度和超算术度的$Σ_2$理论的可判定性,即具有$\leq, 0$和$\sqcup$的语言。这是通过使用Kumabe-Slaman强迫-以及其他已知的结果-来实现的,以表明给定有限上半格$\mathcal{M}$和$\mathcal{N}$,其中$\mathcal{M}$是$\mathcal{N}$的子半格,那么对于这两个度结构,$\mathcal{M}$到结构中的每个嵌入都延伸到$\mathcal{N}$中的一个当且仅当$\mathcal{N}$是$\mathcal{M}$的末端延伸。
英文摘要:
We establish the decidability of the $Σ_2$ theory of both the arithmetic and hyperarithmetic degrees in the language of uppersemilattices i.e. the language with $\leq, 0$ and $\sqcup$. This is achieved by using Kumabe-Slaman forcing - along with other known results - to show that given finite uppersemilattices $\mathcal{M}$ and $\mathcal{N}$, where $\mathcal{M}$ is a subuppersemilattice of $\mathcal{N}$, then for both degree structures, every embedding of $\mathcal{M}$ into the structure extends to one of $\mathcal{N}$ iff $\mathcal{N}$ is an end-extension of $\mathcal{M}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。