Hilbert's Tenth Problem is Unsolvable
From MaRDI portal
Publication:4401926
DOI10.2307/2318447zbMath0277.02008WikidataQ55878720 ScholiaQ55878720MaRDI QIDQ4401926
Publication date: 1973
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2318447
11U05: Decidability (number-theoretic aspects)
11-02: Research exposition (monographs, survey articles) pertaining to number theory
03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations
03B25: Decidability of theories and sets of sentences
03-03: History of mathematical logic and foundations
03D80: Applications of computability and recursion theory
11D99: Diophantine equations
Related Items
The Diophantine Problem for Polynomial Rings and Fields of Rational Functions, 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 ℚ, The challenge of computer mathematics, Elliptic divisibility sequences and undecidable problems about rational points, Computability Theory and Differential Geometry, A survey of computational complexity results in systems and control, Primality testing, An open formalism against incompleteness, Hilbert's tenth problem is of unification type zero, Diophantine definability and decidability in large subrings of totally real number fields and their totally complex extensions of degree 2, A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets, Simple second-order languages for which unification is undecidable, Recursively enumerable sets of polynomials over a finite field, Algorithms for sentences over integral domains, Inferring answers to queries, Diophantine undecidability for some function fields of infinite transcendence degree and positive characteristic, Weak quantifier elimination for the full linear theory of the integers, 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, 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., Diophantine definability and decidability in extensions of degree 2 of totally real fields, On the metamathematics of the P vs. NP question, Recursively enumerable sets of polynomials over a finite field are Diophantine, An existential divisibility lemma for global fields, Unnamed Item, Minimality and completions of PA, 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, Theories of arithmetics in finite models, A Diophantine Problem for Laurent Polynomial Rings, The undecidability of the DA-unification problem, Elliptic curves retaining their rank in finite extensions and Hilbert's Tenth Problem for rings of algebraic numbers, Weakly associative relation algebras with projections, Arithmetic on curves, Register machine proof of the theorem on exponential diophantine representation of enumerable sets, The theory of all substructures of a structure: Characterisation and decision problems, Universal diophantine equation, Diophantine Sets Over Algebraic Integer Rings. II, A sharp version of the bounded Matijasevich conjecture and the end-extension problem, Syntax and semantics of universal programming languages, 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
