Two conjectures on the arithmetic in ℝ and ℂ
From MaRDI portal
Publication:3552394
DOI10.1002/malq.200910004zbMath1278.11106arXivmath/0702558WikidataQ123025412 ScholiaQ123025412MaRDI QIDQ3552394
Publication date: 15 April 2010
Published in: MLQ (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0702558
11U05: Decidability (number-theoretic aspects)
03D15: Complexity of computation (including implicit computational complexity)
03B30: Foundations of classical theories (including reverse mathematics)
15A06: Linear equations (linear algebraic aspects)
11U09: Model theory (number-theoretic aspects)
Cites Work
- Finiteness theorems for abelian varieties over number fields.
- Number theory III: Diophantine geometry
- Some conjectures on addition and multiplication of complex (real) numbers
- Characterizing integers among rational numbers with a universal-existential formula
- A Sharp Bound for Solutions of Linear Diophantine Equations
- Proof of Recursive Unsolvability of Hilbert's Tenth Problem
- Diophantine Representation of the Set of Prime Numbers
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Hilbert's Tenth Problem is Unsolvable
- Algorithms in real algebraic geometry
- Unnamed Item
- Unnamed Item