Decidability of ∀*∀‐Sentences in Membership Theories
From MaRDI portal
Publication:4868240
DOI10.1002/malq.19960420105zbMath0836.03011OpenAlexW2010678885MaRDI QIDQ4868240
Alberto Policriti, Eugenio Giovanni Omodeo, Franco Parlamento
Publication date: 2 May 1996
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19960420105
NP-completenessNP-hardnessfragment of set theorysatisfiability of prenex formulas involving a single universal quantifier
Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Axiomatics of classical set theory and its fragments (03E30)
Related Items
Foundation versus induction in Kripke-Platek set theory, Decidability and completeness for open formulas of membership theories, The decidability of the \(\forall ^*\exists\) class and the axiom of foundation, Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case, The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability, Truth In V for ∃*∀∀-Sentences is Decidable, A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets
Cites Work
