Set-theoretic reductions of Hilbert's tenth problem

DOI10.1007/3-540-52753-2_32MaRDI QIDQ4268492zbMATH OpenFDO

Authors Domenico Cantone, Alberto Policriti, Vincenzo Cutello

Publication date 28 October 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-52753-2_32

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Decidability (number-theoretic aspects) (11U05)

Cited in

(4)

• Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators
• Undecidability results for restricted universally quantified formulae of set theory
• Techniques of computable set theory with applications to proof verification
• Complexity assessments for decidable fragments of set theory. I: A taxonomy for the Boolean case

This page was built for publication: Set-theoretic reductions of Hilbert's tenth problem

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