scientific article; zbMATH DE number 3586989
From MaRDI portal
Publication:4156744
zbMath0377.02001MaRDI QIDQ4156744
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Applications of computability and recursion theory (03D80) Recursively (computably) enumerable sets and degrees (03D25) Diophantine equations (11D99) Connections of number theory and logic (11U99)
Related Items (12)
Further results on Hilbert's tenth problem ⋮ Diophantine questions in the class of finitely generated nilpotent groups ⋮ Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets ⋮ Short Presburger Arithmetic Is Hard ⋮ On the aggregation problem for synthesized web services ⋮ Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank ⋮ Constraint Satisfaction Problems over Numeric Domains ⋮ Martin Davis and Hilbert’s Tenth Problem ⋮ My collaboration with Julia Robinson ⋮ Two problems for solvable and nilpotent groups ⋮ Definability, decidability, complexity ⋮ Unnamed Item
This page was built for publication:
