scientific article
From MaRDI portal
Publication:3489978
zbMATH Open0708.03006MaRDI QIDQ3489978
Alberto Policriti, Domenico Cantone, Vincenzo Cutello
Publication date: 1988
Title of this publication is not available (Why is that?)
quantifier eliminationsatisfiability problemboolean predicate Finitepurely universal formulaequantified theory of setssublanguages of set theory
Decidability of theories and sets of sentences (03B25) Quantifier elimination, model completeness, and related topics (03C10) Set theory (03E99)
Related Items (7)
Decidability results for sets with atoms ⋮ Title not available (Why is that?) ⋮ Undecidability results for restricted universally quantified formulae of set theory ⋮ Decidability of ∀*∀‐Sentences in Membership Theories ⋮ An arithmetical view to first-order logic ⋮ Deciding Universality of ptNFAs is PSpace-Complete ⋮ Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3489978)
