AbstractWe study existential and universal quantification over quantifiers, i.e. quantification where the objects quantified over are Lindstrom quantifiers. First we consider the fragment where only existential quantification over quantifiers is allowed, denoted ΣQ1. We show that ΣQ1 includes inflationary fixed-point logic extended with the ability to express that two defined structures are non-isomorphic, and that ΣQ1 is included in existential second-order logic with the same extension.The logic ΣQn is defined as the fragment where we alternate existential and universal quantification for n levels. We show that ΣQn+1 is included in the n-th level of the complexity theoretical exponential hierarchy. We also show that there is a hierarchy o...
One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of...
We study a hierarchy of logics where each formula of each logic in the hierarchy consists of a formu...
We study first-order logic (FO) over the structure consisting of finite words over some alphabet A, ...
AbstractWe study existential and universal quantification over quantifiers, i.e. quantification wher...
We show that for each n and m, there is an existential first order sentence that is NOT logically eq...
. We show that every formula of the existential fragment of monadic second-order logic over picture ...
Propositional Gödel logic can be extended by quantifiers in different ways, in partic-ular by first-...
We prove that the standard cut is definable in each existentially closed model of IΔ0 + exp by a (pa...
We study quantified propositional logics from the complexity theoretic point of view. First we intro...
We consider extensions of first order logic (FO) and least fixed point logic (LFP) with generalized ...
We study a hierarchy of logics where each formula of each logic in the hierarchy consists of a formu...
We consider extensions of first order logic (FO) and fixed point logic (FP) by means of generalized ...
The unifying theme of the thesis is the semantic meaning of logical quantifiers. In their basic form...
International audienceThis paper gives an overview of the common approach to quantification and gene...
This paper surveys the common approach to quantification and generalised quantification in formal li...
One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of...
We study a hierarchy of logics where each formula of each logic in the hierarchy consists of a formu...
We study first-order logic (FO) over the structure consisting of finite words over some alphabet A, ...
AbstractWe study existential and universal quantification over quantifiers, i.e. quantification wher...
We show that for each n and m, there is an existential first order sentence that is NOT logically eq...
. We show that every formula of the existential fragment of monadic second-order logic over picture ...
Propositional Gödel logic can be extended by quantifiers in different ways, in partic-ular by first-...
We prove that the standard cut is definable in each existentially closed model of IΔ0 + exp by a (pa...
We study quantified propositional logics from the complexity theoretic point of view. First we intro...
We consider extensions of first order logic (FO) and least fixed point logic (LFP) with generalized ...
We study a hierarchy of logics where each formula of each logic in the hierarchy consists of a formu...
We consider extensions of first order logic (FO) and fixed point logic (FP) by means of generalized ...
The unifying theme of the thesis is the semantic meaning of logical quantifiers. In their basic form...
International audienceThis paper gives an overview of the common approach to quantification and gene...
This paper surveys the common approach to quantification and generalised quantification in formal li...
One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of...
We study a hierarchy of logics where each formula of each logic in the hierarchy consists of a formu...
We study first-order logic (FO) over the structure consisting of finite words over some alphabet A, ...