Research Training Network in Model Theory
Publications > Preprint server > Preprint Number 2314

Preprint Number 2314

Previous Next Preprint server

2314. Brian Tyrrell
Finite Undecidability in Fields II: PAC, PRC and PpC Fields

Submission date: 25 December 2022


A field K in a ring language L is finitely undecidable if Cons(Σ) is undecidable for every nonempty finite Σ ⊆ Th(K; L). We adapt arguments originating with Cherlin-van den Dries-Macintyre/Ershov (for PAC fields), Haran (for PRC fields), and Efrat (for PpC fields) to prove all PAC, PRC, and (bounded) PpC fields are finitely undecidable. This work is drawn from the author's PhD thesis and is a sequel to arXiv:2210.12729.

Mathematics Subject Classification:

Keywords and phrases:

Full text arXiv 2212.12918: pdf, ps.

Last updated: December 31 2022 17:55 Please send your corrections to: