Hilbert's Tenth Problem is Unsolvable

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) History of mathematical logic and foundations (03-03) Decidability of theories and sets of sentences (03B25) Applications of computability and recursion theory (03D80) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Diophantine equations (11D99) Decidability (number-theoretic aspects) (11U05)

Cited in

(only showing first 100 items - show all)

Rings of algebraic numbers in infinite extensions of \(\mathbb Q\) and elliptic curves retaining their rank
How to build a hypercomputer
Diophantine undecidability of holomorphy rings of function fields of characteristic 0
On effectively computable realizations of choice functions
Associative-commutative unification
Unification problems with one-sided distributivity
An asymptotic formula for \(\pi\)
Primes are nonnegative values of a polynomial in 10 variables
A new proof of the theorem on exponential diophantine representation of enumerable sets
Undecidability and incompleteness in classical mechanics
Generic oracles, uniform machines, and codes
Automatic verification of a class of systolic circuits
The ring of k-regular sequences
The undecidability of pattern matching in calculi where primitive recursive functions are representable
New techniques and results in multidimensional problems
Some decision problems for polynomial mappings
Some nonstationary linear and quasilinear systems occuring in the investigation of the motion of viscous fluids
Factoring numbers in O(log n) arithmetic steps
Existence of noneffectivizable estimates in the theory of exponential Diophantine equations
A decision algorithm for distributive unification
On q-arithmetic entire functions
The incompleteness of theories of games
A direct method for simulating partial recursive functions by Diophantine equations
Diophantine undecidability in some rings of algebraic numbers of totally real infinite extensions of \(\mathbb{Q}\)
Diophantine representations of linear recurrences. I
The logic of pseudo-\(S\)-integers
An analogue of Hilbert's 10th problem for fields of meromorphic functions over non-Archimedean valued fields
The Matiyasevich theorem. Preliminaries
LCM of sequences of polynomials
Infiniteness sets of primes, admitting diophantine representations in eight variables
A unification-theoretic method for investigating the \(k\)-provability problem
Definability, decidability, complexity
Complete sets of unifiers and matchers in equational theories
Defining integrality at prime sets of high density in number fields.
Hilbert's tenth problem for term algebras with a substitution operator
On a theorem of Matiyasevich
On a Diophantine representation of the predicate of provability
The Riemann hypothesis in computer science
Polynomial time ultrapowers and the consistency of circuit lower bounds
H for Hilbert. \dots and M for mathematics
Basic Diophantine relations
Semi-algebraic sets of \(f\)-vectors
Diophantine sets. II
Formalization of the MRDP theorem in the Mizar system
Power series with coefficients from a finite set
Diophantine definability and decidability in extensions of degree 2 of totally real fields
On the metamathematics of the P vs. NP question
Existential Diophantine definability of string length
Uniform existential interpretation of arithmetic in rings of functions of positive characteristic
Recursively enumerable sets of polynomials over a finite field are Diophantine
An existential divisibility lemma for global fields
Minimality and completions of PA
Diophantine representation of the decimal expansions of e and
Elliptic curve points and Diophantine models of Z in large subrings of number fields
R.J. THOMPSON’S GROUPSFANDTARE BI-INTERPRETABLE WITH THE RING OF THE INTEGERS
Diophantine sets of polynomials over algebraic extensions of the rationals
Defining integers
Three universal representations of recursively enumerable sets
On Dipphantine definability and decidability in some rings of algebraic functions of characteristic 0
Interprétation de l'arithmétique dans certains groupes de permutations affines par morceaux d'un intervalle
Degrees of unsolvability: a tutorial
My Life as a Logician
Extensions of Hilbert's tenth problem: definability and decidability in number theory
A story of Hilbert's tenth problem
What is essential unification?
A Diophantine Problem for Laurent Polynomial Rings
Theories of arithmetics in finite models
The undecidability of the D_A-unification problem
Elliptic curves retaining their rank in finite extensions and Hilbert's Tenth Problem for rings of algebraic numbers
Two conjectures on the arithmetic in \(\mathbb R\) and \(\mathbb C\)
An extension of Büchi's problem for polynomial rings in zero characteristic
Diophantine sets of polynomials over number fields
Weakly associative relation algebras with projections
Arithmetic on curves
Register machine proof of the theorem on exponential diophantine representation of enumerable sets
Diophantine Sets Over Algebraic Integer Rings. II
The theory of all substructures of a structure: Characterisation and decision problems
A survey on Büchi's problem: new presentations and open problems
Universal diophantine equation
A sharp version of the bounded Matijasevich conjecture and the end-extension problem
Syntax and semantics of universal programming languages
The Diophantine Problem for Polynomial Rings and Fields of Rational Functions
Recursively enumerable sets and degrees
Execution traces and programming-language semantics
DIOPHANTINE DEFINABILITY OVER HOLOMORPHY RINGS OF ALGEBRAIC FUNCTION FIELDS WITH INFINITE NUMBER OF PRIMES ALLOWED AS POLES
Extensions of Hilbert's tenth problem
Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories
Existential definability with bounds on archimedean valuations
On Diophantine definability and decidability in some infinite totally real extensions of ℚ
ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS
A plethora of polynomials: a toolbox for counting problems
Hilbert's Tenth Problem in Coq
A simpler undecidability proof for system F inhabitation
scientific article; zbMATH DE number 7566048 (Why is no real title available?)
Parametric Presburger arithmetic: complexity of counting and quantifier elimination
Discrete logarithm diophantiness
Very subjective memories-reflections
The challenge of computer mathematics
The Diophantine problem for addition and divisibility over subrings of the rationals
Representation of squares by monic second degree polynomials in the field of p-adic meromorphic functions

This page was built for publication: Hilbert's Tenth Problem is Unsolvable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4401926)