scientific article; zbMATH DE number 3586989
From MaRDI portal
Publication:4156744
zbMATH Open0377.02001MaRDI QIDQ4156744FDOQ4156744
Publication date: 1977
Title of this publication is not available (Why is that?)
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25) Applications of computability and recursion theory (03D80) Diophantine equations (11D99) Connections of number theory and logic (11U99)
Cited In (14)
- Further results on Hilbert's tenth problem
- Constraint Satisfaction Problems over Numeric Domains
- Two problems for solvable and nilpotent groups
- Diophantine questions in the class of finitely generated nilpotent groups
- Undecidability of the submonoid membership problem for a sufficiently large finite direct power of the Heisenberg group
- Martin Davis and Hilbert’s Tenth Problem
- Theoretical computer science: computability, decidability and logic
- Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank
- Short Presburger Arithmetic Is Hard
- Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets
- Definability, decidability, complexity
- My collaboration with Julia Robinson
- Title not available (Why is that?)
- On the aggregation problem for synthesized web services
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4156744)
