Decidability and undecidability theorems for PAC-fields
From MaRDI portal
Cites work
Cited in
(21)- The undecidability of pseudo real closed fields
- Applied model theory and metamathematics. An Abraham Robinson memorial problem list
- The absolute Galois group of a pseudo real closed field with finitely many orders
- Embedding covers and the theory of Frobenius fields
- Model theory of finite fields and pseudo-finite fields
- Perfect pseudo-algebraically closed fields are algebraically bounded.
- THE ELEMENTARY THEORY OF LARGE FIELDS OF TOTALLY -ADIC NUMBERS
- On Galois groups and PAC substructures
- European Summer Meeting of the Association for Symbolic Logic
- Properties of forking in ω-free pseudo-algebraically closed fields
- Model theory of proalgebraic groups
- Amalgamation of types in pseudo-algebraically closed fields and applications
- On PAC and bounded substructures of a stable structure
- RRC-fields with small absolute Galois groups
- Elementary equivalence theorem for PAC structures
- THE EMBEDDING PROPERTY FOR SORTED PROFINITE GROUPS
- Co-theory of sorted profinite groups for PAC structures
- Measures on perfect \(e\)-free PAC fields
- On algebraically closed fields with a distinguished subfield
- Model completeness for finitely ramified Henselian fields valued in a \(\mathbb{Z}\)-group and for pseudo-algebraically closed fields
- Beyond the Fontaine-Wintenberger theorem
This page was built for publication: Decidability and undecidability theorems for PAC-fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3918210)