scientific article; zbMATH DE number 3918329
[For the entire collection see Zbl 0538.00005.] Let L be a first order language without function symbols. \(\Sigma\) denotes the class of all L-formulas of the form \(\forall y\exists xP(y,x)\wedge \exists x_ 0\forall y_ 1...\forall y_ nQ\) where Q is quantifier-free and contains only dyadic and monadic predicate letters and the identity sign \(\equiv\). Moreover, if a dyadic predicate letter R occurs in Q and R is different from P and from \(\equiv\), then \(Q\to ((Py_ 1y_ 2\to Ry_ 1y_ 2)\wedge (Ry_ 1y_ 2\wedge Ry_ 2y_ 3\to Ry_ 1y_ 3))\) is a tautology. The author gives an outline of a proof of the solvability of \(\Sigma\).
- scientific article; zbMATH DE number 3715502
- The unsolvability of the Gödel class with identity
- scientific article; zbMATH DE number 52574
- Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators
- Satisfiability of formulae with one \(\forall\) is decidable in exponential time
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 Q3693501)