The decision problem for exponential diophantine equations
From MaRDI portal
Publication:1131250
DOI10.2307/1970289zbMath0111.01003OpenAlexW3130727218WikidataQ106474199 ScholiaQ106474199MaRDI QIDQ1131250
Julia Robinson, Martin Davis, Hilary Putnam
Publication date: 1961
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1970289
Related Items
Rank growth of elliptic curves over đ-th root extensions, Diophantine equations with three monomials, On the existential arithmetics with addition and bitwise minimum, Superficies elĂpticas y el dĂ©cimo problema de Hilbert, A TOPOLOGICAL APPROACH TO UNDEFINABILITY IN ALGEBRAIC EXTENSIONS OF, The concept of truth in a finite universe, A direct method for simulating partial recursive functions by Diophantine equations, Hilbert's tenth problem over function fields of positive characteristic not containing the algebraic closure of a finite field, The Diophantine problem in the classical matrix groups, Numerical solution of certain exponential and non-linear Diophantine systems of equations by using a discrete particle swarm optimization algorithm, Further results on Hilbert's tenth problem, Metabelian groups: full-rank presentations, randomness and Diophantine problems, Some undecidable problems involving elementary functions of a real variable, The computability, definability, and proof theory of Artinian rings, Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets, Automorphisms mapping a point into a subvariety, Baire Category Theory and Hilbertâs Tenth Problem Inside $$\mathbb {Q}$$ Q, Incompleteness theorems for random reals, HTP-COMPLETE RINGS OF RATIONAL NUMBERS, NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES, Register machine proof of the theorem on exponential diophantine representation of enumerable sets, Normal bases of PI-algebras., The work of Kim and Roush on questions of decidability in algebra and number theory, Hilbert's Tenth problem for function fields of varieties over number fields and \(p\)-adic fields, Integer solutions of systems of quadratic equations, Elliptic curves, \(L\)-functions, and Hilbert's tenth problem, Circuit satisfiability and constraint satisfaction around Skolem arithmetic, Full rank presentations and nilpotent groups: structure, Diophantine problem, and genericity, Emptiness problems for integer circuits, The Hilbert's-tenth-problem operator, Minsky Machines and Algorithmic Problems, Towards finite-fold Diophantine representations, The quest for Diophantine finite-fold-ness, Unnamed Item, The Problem of Integration in Finite Terms, Finite Generation of Recursively Enumerable Sets, A new proof of the theorem on exponential diophantine representation of enumerable sets, Unsolvable Diophantine Problems, Unnamed Item, Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting), Undecidability, unit groups, and some totally imaginary infinite extensions of â, As easy as $\mathbb {Q}$: Hilbertâs Tenth Problem for subrings of the rationals and number fields, A superposition basis in the class of Kalmar elementary functions, Some undecidable determined games, The Bateman-Horn conjecture: heuristic, history, and applications, Inferring answers to queries, Undecidability and incompleteness in classical mechanics, Hypercomputation by definition, Diophantine representations of linear recurrent sequences. II, THE EXPONENTIAL DIOPHANTINE PROBLEM FOR, My Life as a Logician, Martin Davis and Hilbertâs Tenth Problem, A Story of Hilbertâs Tenth Problem, What Is Essential Unification?, From Mathesis Universalis to Provability, Computability, and Constructivity, Zur Theorie Der Spektralen Darstellung Von PrĂ€dikaten Durch AusdrĂŒcke Der PrĂ€dikatenlogik 1. Stufe, Pragmatic Platonism, On the provability logic of bounded arithmetic, Algebraic cycles from a computational point of view, Knapsack problem for nilpotent groups, The Axiom System IÎŁ0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem, The scope of Gödel's first incompleteness theorem, My collaboration with Julia Robinson, Removing the Strong RSA Assumption from Arguments over the Integers, A light-weight integration of automated and interactive theorem proving, A proof of negative answer to Hilbert's $10$th problem, Three universal representations of recursively enumerable sets, Unnamed Item, Satisfiability of algebraic circuits over sets of natural numbers, Diophantine complexity, Hilbertâs Tenth Problem and Mazurâs Conjecture for large subrings of $\mathbb {Q}$, Unnamed Item, Integer programming formulation of combinatorial optimization problems, Address at the Princeton University Bicentennial Conference on Problems of Mathematics (December 17â19, 1946), By Alfred Tarski, Some decision problems for polynomial mappings, Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem, Some nonstationary linear and quasilinear systems occuring in the investigation of the motion of viscous fluids, Undecidable diophantine equations, Satisfiability of Algebraic Circuits over Sets of Natural Numbers, Existential arithmetization of Diophantine equations, Existence of noneffectivizable estimates in the theory of exponential Diophantine equations, What can and cannot be done with Diophantine problems, Bibliography of Hilary Putnamâs Writings in Logic and Mathematics, Putnam on Foundations: Models, Modals, Muddles, A new technique for obtaining diophantine representations via elimination of bounded universal quantifiers, Descent on elliptic curves and Hilbertâs tenth problem, Problems equivalent to rational Diophantine solvability, Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories, Hilbert's Tenth Problem in Coq, An interpretation-oriented theorem prover over integers, Diophantine representations of the sequence of solutions of the Pell equation, Diophantine definability of nonnorms of cyclic extensions of global fields, Decidability and \(k\)-regular sequences, Emptiness Problems for Integer Circuits, Constructive mathematics and mathematical logic. Part X. Transl. from the Russian, Diophantine problems in solvable groups, Integrality at a prime for global fields and the perfect closure of global fields of characteristic \(p > 2\), Towards Hilbert's tenth problem for rings of integers through Iwasawa theory and Heegner points, Balance problems for integer circuits, The Developments of the Concept of Machine Computability from 1936 to the 1960s, The number of solutions of a diophantine equation over a recursive ring, Julia Robinson, in memoriam, Universal diophantine equation, Some diophantine forms of gödel's theorem, An isomorphism between monoids of external embeddings: About definability in arithmetic, Computable procedures for fields
