On the Decidability of the ∃*∀* Prefix Class in Set Theory

Abstract

In this talk I will describe the set-theoretic version of the Classical Decision Problem for First Order Logic. I will then illustrate the result on the decidability of the satisfiability problem class of purely universal formulae (∃∗∀∗-sentences) on the unquantified language whose relational symbols are membership and equality. The class we studied is, in… (More)

Topics

  • Presentations referencing similar topics