On the Relationship Between Matiyasevich's and Smorynski's Theorems

DOI10.7561/SACS.2019.1.101MaRDI QIDQ5089608FDO

Authors Agnieszka Peszek, Apoloniusz Tyszka

Publication date 19 July 2022

Published in Scientific Annals of Computer Science (Search for Journal in Brave)

zbMATH Keywords

Matiyasevich's theoremcomputable setrecursively enumerable setDavis-Putnam-Robinson-Matiyasevich theoremHilbert's Tenth Problem for solutions in a subring of \(\mathbb{Q}\)Smoryński's theorem

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Recommendations

• On a theorem of Matiyasevich
• scientific article; zbMATH DE number 3909312
• A theorem connected with results of Steinhaus and Smítal
• On a generalization of Smirnov's theorem with some applications
• The Matiyasevich theorem. Preliminaries
• The Krein-Šmulian theorem and its extensions
• scientific article; zbMATH DE number 3884948
• On a theorem Mouchtari and Serstnev
• On S. M. Nikol'skii's theorem and P. P. Mosolov's conjecture
• On the Mairhuber-Morozov theorem

Cited in

(3)

• On a theorem of Matiyasevich
• On Diophantine sets over polynomial rings
• Recursively enumerable sets of polynomials over a finite field are Diophantine

This page was built for publication: On the Relationship Between Matiyasevich's and Smorynski's Theorems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089608)