Embedding relations in the lattice of recursively enumerable sets.
Page 1
Donald A. Alton (1975)
Archiv für mathematische Logik und Grundlagenforschung
Kurt Hauschild, Wolfgang Rautenberg (1973)
Fundamenta Mathematicae
Joseph Becker, Leonard Lipshitz (1981)
Fundamenta Mathematicae
Limet, Sébastien, Réty, Pierre (1997)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Thanases Pheidas, Xavier Vidaux (2005)
Fundamenta Mathematicae
We generalize a question of Büchi: Let R be an integral domain, C a subring and k ≥ 2 an integer. Is there an algorithm to decide the solvability in R of any given system of polynomial equations, each of which is linear in the kth powers of the unknowns, with coefficients in C? We state a number-theoretical problem, depending on k, a positive answer to which would imply a negative answer to the question for R = C = ℤ. We reduce a negative answer for k = 2 and for...
Page 1