Martin Davis and Hilbert’s Tenth Problem
From MaRDI portal
Publication:3305315
DOI10.1007/978-3-319-41842-1_2zbMath1439.03080OpenAlexW2585437719MaRDI QIDQ3305315
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_2
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 mathematical logic and foundations (03-03)
Related Items (5)
The quest for Diophantine finite-fold-ness ⋮ Unnamed Item ⋮ Pell's equation ⋮ Unnamed Item ⋮ Hilbert's Tenth Problem in Coq
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Representation theorems for recursively enumerable sets and a conjecture related to Poonen's large subring of \(\mathbb Q\)
- Existential arithmetization of Diophantine equations
- The decision problem for exponential diophantine equations
- A new proof of the theorem on exponential diophantine representation of enumerable sets
- Arithmetical representations of enumerable sets with a small number of quantifiers
- Existence of noneffectivizable estimates in the theory of exponential Diophantine equations
- A direct method for simulating partial recursive functions by Diophantine equations
- On investigations on some algorithmic problems in algebra and number theory
- The primes contain arbitrarily long arithmetic progressions
- Arithmetical representation of recursively enumerable sets
- Mathematical significance of consistency proofs
- Register machine proof of the theorem on exponential diophantine representation of enumerable sets
- An unsolvable problem in number theory
- Universal diophantine equation
- Proof of Recursive Unsolvability of Hilbert's Tenth Problem
- Hilbert’s Tenth Problem and Mazur’s Conjecture for large subrings of $\mathbb {Q}$
- 48 More Solutions of Martin Davis's Quaternary Quartic Equation
- Recursive Unsolvability of a problem of Thue
- On the Number of Solutions of Diophantine Equations
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Unsolvable Diophantine Problems
- An explicit diophantine definition of the exponential function
- Some representations of Diophantine sets
- DIOPHANTINE SETS
- New Computational Paradigms
- Existential Definability in Arithmetic
- Arithmetical problems and recursively enumerable predicates
- Recursively enumerable sets of positive integers and their decision problems
- Decidability of some Problems Pertaining to Base 2 Exponential Diophantine Equations
This page was built for publication: Martin Davis and Hilbert’s Tenth Problem
