A class of non-conservative determiners in Polish
Lingvisticae InvestigationesPublished 31 December 2004
Richard Zuber
Citations19
SJR quartileQ3
SJR score0.12
SNIP0.59
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Summary A class of complex determiners in Polish is described and some of their formal properties are discussed. These determiners are not conservative. They are, however, systematically related by the operation of inversion of arguments to the conservative (atomic co-intersective) determiners represented by generalized universal quantifiers denoted by various exclusion phrases.
Keywords
Computer ScienceArts and HumanitiesSocial Sciences
Studies in cognitive systemsGeneralized Quantifiers and Natural Language
1,631 Citations1981Jon Barwise, Robin Cooper
In 1957, the Polish logician Andrej Mostowski pointed out that there are many mathematically interesting quantifiers that are not definable in terms of the first-order ∀, ∃ and initiated study of so-called generalized quantifiers, which has forced logicians to rethink the traditional theory of quantification.
Boolean Semantics for Natural Language
318 Citations1984Edward L. Keenan, Leonard M. Faltz
Boolean Semantics: An Overview, Defining Interpretations for L, and Why should TN Be Complete and Atomic?
Journal of Symbolic LogicNatural language, sortal reducibility and generalized quantifiers
66 Citations1993Edward L. Keenan
It is shown that English quantifiers of type 〈1, 1〉 are booleanly generated by their generalized universal and generalized existential members, which constitute the sortally reducible members of this type.
Journal of Semantics‘Only’ as a Determiner and as a Generalized Quantifier
32 Citations1991Sjaak de Mey
Proceedings from Semantics and Linguistic TheoryOn the Semantics of Exclusion and Inclusion Phrases
17 Citations1998Richard Zuber
Lecture notes in computer scienceAtomicity of Some Categorially Polyvalent Modifiers
4 Citations2001Richard Zuber
It is shown that the particle only, considered as a categorially polyvalent modifier, denotes atoms of the corresponding denotational Boolean algebras and explains its relatively constant meaning in all expressions with various categories in which it can occur.