Some extension of results on the decidability of classes of formulas in set theory is proved. In particular some class of restricted quantified formulas is proved to be decidable also in the case in which the underlying axiomatic set theory does not contain the axiom of foundation. For all the classes considered is also studied whether or not they result to be not only decidable, but also complete and a simple decidable but not complete class of formulas is presented
As is well-known, the Bernays-Schonfinkel-Ramsey class of all prenex there exists *for all* V-senten...
‘How can we recognize, given axioms and inference rules of a calculus, whether the calculus has such...
AbstractThe Logic of Proofs realizes the modalities from traditional modal logics with proof polynom...
An extension of results on the decidability of classes of formulas in set theory is proved. In parti...
A general mechanism to extend decision algorithms to deal with additional predicates is described. T...
This paper surveys various decidability results in the set theory. In the first part, we focus on ce...
As proved recently. the satisfaction problem for all prenex formulae in the set-theoretic Bernays-Sh...
As proved recently, the satisfiability problem for all prenex formulae in the set-theoretic Bernays-...
The aim of this work is to develop the tool of logical deduction schemata and use it to establish up...
We consider positive rules in which the conclusion may contain existentially quantified variables, w...
A useful method of proving the finite decidability of an equationally definable class V of algebras...
It is well known that quantifier elimination plays a relevant role in proving decidability of theori...
The problem is addressed of establishing the satisfiability of prenex formulas involving a single un...
We consider positive rules in which the conclusion may contain existentially quantified variables, w...
AbstractWe carry out a systematic study of decidability for theories (a) of real vector spaces, inne...
As is well-known, the Bernays-Schonfinkel-Ramsey class of all prenex there exists *for all* V-senten...
‘How can we recognize, given axioms and inference rules of a calculus, whether the calculus has such...
AbstractThe Logic of Proofs realizes the modalities from traditional modal logics with proof polynom...
An extension of results on the decidability of classes of formulas in set theory is proved. In parti...
A general mechanism to extend decision algorithms to deal with additional predicates is described. T...
This paper surveys various decidability results in the set theory. In the first part, we focus on ce...
As proved recently. the satisfaction problem for all prenex formulae in the set-theoretic Bernays-Sh...
As proved recently, the satisfiability problem for all prenex formulae in the set-theoretic Bernays-...
The aim of this work is to develop the tool of logical deduction schemata and use it to establish up...
We consider positive rules in which the conclusion may contain existentially quantified variables, w...
A useful method of proving the finite decidability of an equationally definable class V of algebras...
It is well known that quantifier elimination plays a relevant role in proving decidability of theori...
The problem is addressed of establishing the satisfiability of prenex formulas involving a single un...
We consider positive rules in which the conclusion may contain existentially quantified variables, w...
AbstractWe carry out a systematic study of decidability for theories (a) of real vector spaces, inne...
As is well-known, the Bernays-Schonfinkel-Ramsey class of all prenex there exists *for all* V-senten...
‘How can we recognize, given axioms and inference rules of a calculus, whether the calculus has such...
AbstractThe Logic of Proofs realizes the modalities from traditional modal logics with proof polynom...
Add to ORKG