As part of a project aimed at the implementation of a proof-checker based on the set-theoretic formalism, the decision problem in set theory has been studied very intensively, starting in the late seventies. Several results have been produced in the first decade of research, giving rise to the novel field of computable set theory. At that point, it already was clear that to face the tremendous amount of technicalities involved in the combination of smaller decidable fragments into larger ones, new techniques were in order. Such techniques have recently emerged, by a careful analysis of the formation process of disjoint families of sets. This has led to the characterization of suitable decidable conditions for the satisfiability of set-theoretic formulae belonging to specific collections. In this paper we give an elementary introduction to the formative process technique and discuss some open problems.
|Data di pubblicazione:||2004|
|Titolo:||Applications of formative processes to the decision problem in set theory|
|Parole Chiave:||Satisfiability decision problem; satisfaction algorithm; Zermelo-Fraenkel set theory|
|Appare nelle tipologie:||Articolo su Rivista|