Following Henkin’s discovery of partially-ordered (branching) quantification (POQ) with standard quantifiers in 1959, philosophers of language have attempted to extend his definition to POQ with generalized quantifiers. In this paper I propose a general definition of POQ with 1-place generalized quantifiers of the simplest kind: namely, predicative, or “cardinality ” quantifiers, e.g., “most”, “few”, “finitely many”, “exactly α”, where α is any cardinal, etc. The definition is obtained in a series of generalizations, extending the original, Henkin definition first to a general definition of monotone-increasing (M↑) POQ and then to a general definition of generalized POQ, regardless of monotonicity. The extension is based on (i) Barwise’s 19...
We begin with a disucssion of some of the serious deficiencies of first order predicate languages. T...
We analyze computational aspects of partially ordered quantification i first-order logic. show that ...
This paper investigates the behaviour of binary quantifiers in settings of incomplete information, i...
Following Henkin's discovery of partially-ordered (branching) quantification (POQ) with standard qua...
this paper can be viewed both as a new semantics for generalized quantifiers and as a new look at st...
Quantified terms are terms of generality. They are also provide some of our prime examples of the ph...
Recent work in generalized quantifier theory has greatly increased our understanding of the types of...
Abstract We consider extensions of fixed-point logic by means of generalized quantifiers in the cont...
In natural language there are determiners which combine with nouns to form noun phrases. The mathema...
In this paper, we study the game-theoretic and computational repercussions of Henkin’s partially ord...
We analyze computational aspects of partially ordered quantification in first-order logic. Show that...
We study the computational complexity of polyadic quantifiers in natural language. This type of quan...
This note explains the circumstances under which a type <1> quantifier can be decomposed into a type...
We show how sequent calculi for some generalized quantifiers can be obtained by generalizing the Her...
The Generalized Quantifiers Theory, I will argue, in the second half of last Century has led to an i...
We begin with a disucssion of some of the serious deficiencies of first order predicate languages. T...
We analyze computational aspects of partially ordered quantification i first-order logic. show that ...
This paper investigates the behaviour of binary quantifiers in settings of incomplete information, i...
Following Henkin's discovery of partially-ordered (branching) quantification (POQ) with standard qua...
this paper can be viewed both as a new semantics for generalized quantifiers and as a new look at st...
Quantified terms are terms of generality. They are also provide some of our prime examples of the ph...
Recent work in generalized quantifier theory has greatly increased our understanding of the types of...
Abstract We consider extensions of fixed-point logic by means of generalized quantifiers in the cont...
In natural language there are determiners which combine with nouns to form noun phrases. The mathema...
In this paper, we study the game-theoretic and computational repercussions of Henkin’s partially ord...
We analyze computational aspects of partially ordered quantification in first-order logic. Show that...
We study the computational complexity of polyadic quantifiers in natural language. This type of quan...
This note explains the circumstances under which a type <1> quantifier can be decomposed into a type...
We show how sequent calculi for some generalized quantifiers can be obtained by generalizing the Her...
The Generalized Quantifiers Theory, I will argue, in the second half of last Century has led to an i...
We begin with a disucssion of some of the serious deficiencies of first order predicate languages. T...
We analyze computational aspects of partially ordered quantification i first-order logic. show that ...
This paper investigates the behaviour of binary quantifiers in settings of incomplete information, i...