Journal of Symbolic Logic · 2000 · 33 citations · 7 references
HumanitiesComputer ScienceMathematicsCombinatoricsLogicTheory Of ComputationFirst-order LogicMathematical LogicPredicate LogicRamsey TheoryGeneralized QuantifiersQuantifier EliminationRamsey AlgebrasRamsey Spaces
Abstract A combinatorial criterium is given when a monadic quantifier is expressible by means of universe-independent monadic quantifiers of width n . It is proved that the corresponding hierarchy does not collapse. As an application, it is shown that the second resumption (or vectorization) of the Härtig quantifier is not definable by monadic quantifiers. The techniques rely on Ramsey theory.
7
Micheál Jacob · Health Education Journal · 1989 · 3.1K citations · Full text
On a generalization of quantifiers
Andrzej Mostowski · Fundamenta Mathematicae · 1957 · 688 citations · Full text
First Order Predicate Logic with Generalized Quantifiers
PERLINDSTRÖM · Theoria · 1966 · 474 citations
Definability hierarchies of generalized quantifiers
Lauri Hella · Annals of Pure and Applied Logic · 1989 · 86 citations