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.

From Hilbert's 10th problem to slim, undecidable fragments of set theory

Cantone D.
;
2020-01-01

Abstract

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.
2020
(∀∃)0 formulas
Cartesian product
Hilbert's 10th problem
Proof-checkers
Sat-isfiability problem
Undecidability
ZF set theory
File in questo prodotto:
File Dimensione Formato  
Cantone2020_FromHilberts10thproblem-paper_5.pdf

accesso aperto

Descrizione: Articolo principale
Tipologia: Documento in Post-print
Licenza: Creative commons
Dimensione 693.98 kB
Formato Adobe PDF
693.98 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11769/497272
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? ND
social impact