Defining integers
From MaRDI portal
Barry Mazur's Conjecturedecidability of the first order theorydefinability of the integers in ringsfield of rational numbersfields of meromorphic functions over complex or \(p\)-adic numbersfunction fieldsHilbert Tenth ProblemKoenigsmann's Constructionnumber fieldsPoonen's ConstructionPoonen-Cornelissen Construction
Abstract: We survey the recent developments in the area that grew out of attempts to extend an analog of Hilbert's Tenth Problem to the field of rational numbers and rings of integers of number fields. The paper is based on a plenary talk the author gave at the North American Annual ASL meeting at the University of Notre Dame in May of 2009.
Recommendations
Cites work
- Characterizing integers among rational numbers with a universal-existential formula
- Definability and decision problems in arithmetic
- Defining integrality at prime sets of high density in number fields.
- Diophantine definability over some rings of algebraic numbers with infinite number of primes allowed in the denominator
- Division-ample sets and the Diophantine problem for rings of integers
- Elliptic curves retaining their rank in finite extensions and Hilbert's Tenth Problem for rings of algebraic numbers
- Hilbert's Tenth Problem is Unsolvable
- Hilbert’s Tenth Problem and Mazur’s Conjecture for large subrings of $\mathbb {Q}$
- scientific article; zbMATH DE number 1973372 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Questions of decidability and undecidability in Number Theory
- Ranks of twists of elliptic curves and Hilbert's tenth problem
- Rings of algebraic numbers in infinite extensions of \(\mathbb Q\) and elliptic curves retaining their rank
Cited in
(12)- Characterizing integers among rational numbers with a universal-existential formula
- A New Proof of McKenna's Theorem
- Integers
- A diophantine definition of integers in the rings of rational numbers
- Julia Robinson numbers
- An exact correspondence of linear problems and randomizing linear algorithms
- The Diophantine problem for addition and divisibility over subrings of the rationals
- Uniform definability of integers in reduced indecomposable polynomial rings
- \mathbb Q\setminus \mathbb Z is diophantine over \mathbb Q with 32 unknowns
- Linear loop synthesis for quadratic invariants
- Undecidability of indecomposable polynomial rings
- Integer valued means
This page was built for publication: Defining integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011104)