A Story of Hilbert’s Tenth Problem
From MaRDI portal
Publication:3305317
DOI10.1007/978-3-319-41842-1_4zbMath1439.03011OpenAlexW2584423532MaRDI QIDQ3305317
Publication date: 6 August 2020
Published in: Outstanding Contributions to Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-41842-1_4
Decidability (number-theoretic aspects) (11U05) History of mathematics in the 20th century (01A60) Undecidability and degrees of sets of sentences (03D35) History of mathematics in the 21st century (01A61) History of number theory (11-03) History of mathematical logic and foundations (03-03)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The decision problem for exponential diophantine equations
- A new proof of the theorem on exponential diophantine representation of enumerable sets
- The primes contain arbitrarily long arithmetic progressions
- Reductions of Hilbert's tenth problem
- Register machine proof of the theorem on exponential diophantine representation of enumerable sets
- Hilbert's Tenth Problem is Unsolvable
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
- Existential Definability in Arithmetic
- Arithmetical problems and recursively enumerable predicates
This page was built for publication: A Story of Hilbert’s Tenth Problem