Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-27T06:37:27.617Z Has data issue: false hasContentIssue false
  • English
  • Français

A CLASS OF FIELDS WITH A RESTRICTED MODEL COMPLETENESS PROPERTY

Part of: Model theory Connections with logic General field theory

Published online by Cambridge University Press:  26 March 2021

PHILIP DITTMANN  and
DION LEIJNSE
PHILIP DITTMANN
Affiliation:
INSTITUT FÜR ALGEBRA TU DRESDEN, DRESDEN, GERMANYE-mail:[email protected]
DION LEIJNSE
Affiliation:
RADBOUD UNIVERSITEIT NIJMEGEN NIJMEGEN, THE NETHERLANDSE-mail:[email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We introduce and study a natural class of fields in which certain first-order definable sets are existentially definable, and characterise this class by a number of equivalent conditions. We show that global fields belong to this class, and in particular obtain a number of new existential (or diophantine) predicates over global fields.

Keywords

field theorypolynomial idealdiophantine setdefinabilitymodel complete

MSC classification

Primary: 12L12: Model theory
Secondary: 03C10: Quantifier elimination, model completeness and related topics 12E05: Polynomials (irreducibility, etc.)
Type
Article
Information
The Journal of Symbolic Logic , Volume 86 , Issue 2 , June 2021 , pp. 701 - 708
Check for updates
Copyright
© The Association for Symbolic Logic 2021

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bourbaki, N., Algèbre, Chapitres 4 à 7, Springer-Verlag, Berlin and Heidelberg, 2007.CrossRefGoogle Scholar
Dittmann, P., Irreducibility of polynomials over global fields is diophantine. Compositio Mathematica, vol. 154 (2018), no. 4, pp. 761–772.10.1112/S0010437X17007977CrossRefGoogle Scholar
Dittmann, P., A model-theoretic approach to the arithmetic of global fields, Ph.D. thesis, University of Oxford, 2018. Available at https://ora.ox.ac.uk/objects/uuid:c798e052-b305-4cca-8964-e7959e486a5d.Google Scholar
van den Dries, L., Algorithms and bounds for polynomial rings, Logic Colloquium ’78 (Boffa, M., Dalen, D., and McAloon, K., editors), Studies in Logic and the Foundations of Mathematics, vol. 97, North-Holland, Amsterdam and New York, 1979, pp. 147–157.Google Scholar
van den Dries, L. and Schmidt, K., Bounds in the theory of polynomial rings over fields. A nonstandard approach. Inventiones Mathematicae, vol. 76 (1984), no. 1, pp. 77–91.CrossRefGoogle Scholar
Fried, M. D. and Jarden, M., Field Arithmetic, third ed., Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge, vol. 11, Springer-Verlag, Berlin, 2008, revised by Jarden.Google Scholar
Hodges, W., A Shorter Model Theory, Cambridge University Press, Cambridge, 1997.Google Scholar
Lang, S., Algebra, third ed., Addison-Wesley, Reading, 1993.Google Scholar
Messmer, M., Some model theory of separably closed fields, Model Theory of Fields (Marker, D., Messmer, M., and Pillay, A., editors), Lecture Notes in Logic, vol. 5, Springer, Berlin, 1996, pp. 135–152.CrossRefGoogle Scholar
Rumely, R. S., Undecidability and definability for the theory of global fields. Transactions of the American Mathematical Society, vol. 262 (1980), no. 1, pp. 195–217.CrossRefGoogle Scholar
Wood, C., Notes on the stability of separably closed fields, this Journal, vol. 44 (1979), no. 3, pp. 412–416.Google Scholar