This paper is a sequel to the papers [4,6] in which an alternative skolemization method called ekolemization was introduced that, when applied to the strong existential quantifiers in a formula, is sound and complete for constructive theories. Based on that method an analogue of Herbrand’s theorem was proved to hold as well. In this paper we extend the method to universal quantifiers and show that for theories satisfying the witness property the method is sound and complete for all formulas. We prove a Herbrand theorem and, as an example, apply the method to several constructive theories. We show that for the theories with decidable quantifier-free fragment, also the strong existential quantifier fragment is decidable
The thesis formulates and proves a witnessing theorem for SPV -provable formulas in the form ∀x∃yA(x...
It is well known that quantifier elimination plays a relevant role in proving decidability of theori...
We consider the following classes of quantified formulas. Fix a set of basic relations called a basi...
AbstractThis paper is a sequel to the papers Baaz and Iemhoff (2006, 2009) [4,6] in which an alterna...
AbstractIn this paper an alternative Skolemization method is introduced that, for a large class of f...
In [2] an alternative skolemization method called eskolemization was introduced that is sound and co...
In this paper an alternative Skolemization method is introduced that for a large class of formulas i...
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is intro...
AbstractWe study existential and universal quantification over quantifiers, i.e. quantification wher...
Skolemization is a means to eliminate existential quantifiers within predicate logic sentences and t...
Skolemization is a means to eliminate existential quantifiers within predicate logic sentences by r...
The logic L(Qu) extends first-order logic by a generalized form of counting quantifiers (“the number...
AbstractWe investigate the universal fragment of intuitionistic logic focussing on equality of proof...
AbstractIn 1985, van den Dries showed that the theory of the reals with a predicate for the integer ...
The problem is addressed of establishing the satisfiability of prenex formulas involving a single un...
The thesis formulates and proves a witnessing theorem for SPV -provable formulas in the form ∀x∃yA(x...
It is well known that quantifier elimination plays a relevant role in proving decidability of theori...
We consider the following classes of quantified formulas. Fix a set of basic relations called a basi...
AbstractThis paper is a sequel to the papers Baaz and Iemhoff (2006, 2009) [4,6] in which an alterna...
AbstractIn this paper an alternative Skolemization method is introduced that, for a large class of f...
In [2] an alternative skolemization method called eskolemization was introduced that is sound and co...
In this paper an alternative Skolemization method is introduced that for a large class of formulas i...
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is intro...
AbstractWe study existential and universal quantification over quantifiers, i.e. quantification wher...
Skolemization is a means to eliminate existential quantifiers within predicate logic sentences and t...
Skolemization is a means to eliminate existential quantifiers within predicate logic sentences by r...
The logic L(Qu) extends first-order logic by a generalized form of counting quantifiers (“the number...
AbstractWe investigate the universal fragment of intuitionistic logic focussing on equality of proof...
AbstractIn 1985, van den Dries showed that the theory of the reals with a predicate for the integer ...
The problem is addressed of establishing the satisfiability of prenex formulas involving a single un...
The thesis formulates and proves a witnessing theorem for SPV -provable formulas in the form ∀x∃yA(x...
It is well known that quantifier elimination plays a relevant role in proving decidability of theori...
We consider the following classes of quantified formulas. Fix a set of basic relations called a basi...