scientific article

zbMath0994.03002MaRDI QIDQ2715528

Yu. V. Matiyasevich

Publication date: 26 July 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

decidabilityHilbert's tenth problem

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) History of mathematics in the 20th century (01A60) Undecidability and degrees of sets of sentences (03D35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) History of number theory (11-03) Decidability of theories and sets of sentences (03B25) Exponential Diophantine equations (11D61) Higher degree equations; Fermat's equation (11D41) History of mathematical logic and foundations (03-03) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Future perspectives in mathematics (01A67)

Related Items

On the Termination of Integer Loops ⋮ Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets ⋮ Existential Diophantine definability of string length ⋮ On some algebraic ways to calculate zeros of the Riemann zeta function ⋮ Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation ⋮ The DPRM Theorem in Isabelle (Short Paper). ⋮ Martin Davis and Hilbert’s Tenth Problem ⋮ Metric structures and probabilistic computation ⋮ Polynomial parametrization for the solutions of Diophantine equations and arithmetic groups ⋮ Is mathematics problem solving or theorem proving? ⋮ The Riemann hypothesis in computer science

This page was built for publication: