The following pages link to (Q4156744):
Displaying 14 items.
- Diophantine questions in the class of finitely generated nilpotent groups (Q285579) (← links)
- On the aggregation problem for synthesized web services (Q389232) (← links)
- Further results on Hilbert's tenth problem (Q829448) (← links)
- My collaboration with Julia Robinson (Q1208619) (← links)
- Definability, decidability, complexity (Q1817073) (← links)
- Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets (Q1887829) (← links)
- Two problems for solvable and nilpotent groups (Q2026741) (← links)
- Martin Davis and Hilbert’s Tenth Problem (Q3305315) (← links)
- Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
- Short Presburger Arithmetic Is Hard (Q5073520) (← links)
- (Q5150533) (← links)
- Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank (Q6085106) (← links)
- Undecidability of the submonoid membership problem for a sufficiently large finite direct power of the Heisenberg group (Q6587386) (← links)
- Theoretical computer science: computability, decidability and logic (Q6602262) (← links)
