scientific article; zbMATH DE number 3586989
From MaRDI portal
Publication:4156744
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
(16)- My collaboration with Julia Robinson
- Definability, decidability, complexity
- Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets
- Two problems for solvable and nilpotent groups
- Diophantine questions in the class of finitely generated nilpotent groups
- Martin Davis and Hilbert's tenth problem
- On the aggregation problem for synthesized web services
- Constraint satisfaction problems over numeric domains
- Short Presburger Arithmetic Is Hard
- On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups
- Undecidability of the submonoid membership problem for free nilpotent group of class l\geqslant 2 of sufficiently large rank
- Undecidability of the submonoid membership problem for a sufficiently large finite direct power of the Heisenberg group
- Theoretical computer science: computability, decidability and logic
- Mixed quantifier prefixes over Diophantine equations with integer variables
- On decidability of the product of subgroups membership problem for nilpotent groups
- Further results on Hilbert's tenth problem
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)
