Brian Tyrrell-Nic Dhonncha

dblp:425/9098 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-author · 2 since 2021
YearPublicationVenuePosition
2025 Finite Undecidability in NIP Fields
abstract
Abstract A field K in a ring language $\mathcal {L}$ is finitely undecidable if $\mbox {Cons}(T)$ is undecidable for every nonempty finite $T \subseteq {\mathtt{Th}}(K; \mathcal {L})$ . We extend a construction of Ziegler and (among other results) use a first-order classification of Anscombe and Jahnke to prove every NIP henselian nontrivially valued field is finitely undecidable. We conclude (assuming the NIP Fields Conjecture) that every NIP field is finitely undecidable. This work is drawn from the author’s PhD thesis [48, Chapter 3].
Brian Tyrrell-Nic Dhonncha
J. Symb. Log.1
2024 Finite undecidability in PAC and PRC fields
abstract
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) and Haran (for PRC fields) to prove all PAC and PRC fields are finitely undecidable. We describe the difficulties that arise in adapting the proof to PpC fields, and show no bounded PpC field is finitely axiomatisable. This work is drawn from the author's PhD thesis [44, Chapter 4].
Brian Tyrrell-Nic Dhonncha
Ann. Pure Appl. Log.1