DIOPHANTINE REPRESENTATION OF ENUMERABLE PREDICATES

DOI10.1070/IM1971v005n01ABEH001004zbMath0252.02047OpenAlexW2071093314MaRDI QIDQ5665188

Yu. V. Matiyasevich

Publication date: 1972

Published in: Mathematics of the USSR-Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/im1971v005n01abeh001004

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80)

Related Items

A normal form theorem for first order formulas and its application to Gaifman's splitting theorem, Rewriting, and equational unification: the higher-order cases, Embedding Boolean expressions into logic programming, Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank, On a theorem of Matiyasevich, Bi-interpretability of some monoids with the arithmetic and applications, Using computability to measure complexity of algebraic structures and classes of structures, Robinson forcing is not absolute, Unnamed Item