论文信息 - From Hilbert's 10th Problem to slim, Undecidable Fragments of Set Theory

From Hilbert's 10th Problem to slim, Undecidable Fragments of Set Theory

We revisit, deepen, and make more systematic, the study— undertaken ca. 1990—of reductions of Hilbert’s tenth problem to fragments of set theory, whereby sublanguages of the Zermelo-Fraenkel axiomatic theory are shown to have an undecidable satisfiability problem.

[1] T. Skolem. Über die Nicht-charakterisierbarkeit der Zahlenreihe mittels endlich oder abzählbar unendlich vieler Aussagen mit ausschliesslich Zahlenvariablen , 1934 .

[2] J. L. Britton. Integer solutions of systems of quadratic equations , 1979 .

[3] Vincenzo Cutello,et al. Set-Theoretic Reductions of Hilbert's Tenth Problem , 1989, CSL.

[4] Solomon Feferman,et al. The collected works of Julia Robinson , 1996 .

[5] Yuri V. Matiyasevich. Existential arithmetization of Diophantine equations , 2009, Ann. Pure Appl. Log..

[6] Domenico Cantone,et al. Set Theory for Computing: From Decision Procedures to Declarative Programming with Sets , 2011 .

[7] Erik Massop. Hilbert's tenth problem , 2012 .

[8] Domenico Cantone,et al. Formative processes with applications to the decision problem in set theory: II. Powerset and singleton operators, finiteness predicate , 2014, Inf. Comput..

[9] Yuri V. Matiyasevich,et al. Martin Davis and Hilbert's Tenth Problem , 2016, Martin Davis on Computability, Computational Logic, and Mathematical Foundations.