This website requires JavaScript.

Finite Undecidability in Fields II: PAC, PRC and PpC Fields

Brian Tyrrell
Dec 2022
摘要
A field $K$ in a ring language $\mathcal{L}$ is finitely undecidable if$\mbox{Cons}(\Sigma)$ is undecidable for every nonempty finite $\Sigma\subseteq \mbox{Th}(K; \mathcal{L})$. We adapt arguments originating withCherlin-van den Dries-Macintyre/Ershov (for PAC fields), Haran (for PRCfields), and Efrat (for PpC fields) to prove all PAC, PRC, and (bounded) PpCfields are finitely undecidable. This work is drawn from the author's PhDthesis and is a sequel to arXiv:2210.12729.
展开全部
图表提取

暂无人提供速读十问回答

论文十问由沈向洋博士提出,鼓励大家带着这十个问题去阅读论文,用有用的信息构建认知模型。写出自己的十问回答,还有机会在当前页面展示哦。

Q1论文试图解决什么问题?
Q2这是否是一个新的问题?
Q3这篇文章要验证一个什么科学假设?
0
被引用
笔记
问答