Decidability and undecidability theorems for PAC-fields
From MaRDI portal
Publication:3918210
DOI10.1090/S0273-0979-1981-14872-2zbMath0466.12017OpenAlexW2009428537MaRDI QIDQ3918210
Angus J. Macintyre, Gregory L. Cherlin, L. P. D. van den Dries
Publication date: 1981
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0273-0979-1981-14872-2
Decidability and field theory (12L05) Rational points (14G05) Decidability of theories and sets of sentences (03B25) Limits, profinite groups (20E18)
Related Items
The absolute Galois group of a pseudo real closed field with finitely many orders ⋮ Model theory of finite fields and pseudo-finite fields ⋮ THE EMBEDDING PROPERTY FOR SORTED PROFINITE GROUPS ⋮ Co-theory of sorted profinite groups for PAC structures ⋮ THE ELEMENTARY THEORY OF LARGE FIELDS OF TOTALLY -ADIC NUMBERS ⋮ Perfect pseudo-algebraically closed fields are algebraically bounded. ⋮ Embedding covers and the theory of Frobenius fields ⋮ On Galois groups and PAC substructures ⋮ RRC-fields with small absolute Galois groups ⋮ Model theory of proalgebraic groups ⋮ Amalgamation of types in pseudo-algebraically closed fields and applications ⋮ On PAC and bounded substructures of a stable structure ⋮ ELEMENTARY EQUIVALENCE THEOREM FOR PAC STRUCTURES ⋮ European Summer Meeting of the Association for Symbolic Logic ⋮ The undecidability of pseudo real closed fields ⋮ Applied model theory and metamathematics. An Abraham Robinson memorial problem list ⋮ Properties of forking in ω-free pseudo-algebraically closed fields
Cites Work