Generalized Quantifiers and Logical Reducibilities
نویسندگان
چکیده
منابع مشابه
Generalized Quantifiers and Logical Reducibilities
We consider extensions of first order logic (FO) and least fixed point logic (LFP) with generalized quantifiers in the sense of Lindström [Lin66]. We show that adding a finite set of such quantifiers to LFP fails to capture all polynomial time properties of structures, even over a fixed signature. We show that this strengthens results in [Hel92] and [KV92a]. We also consider certain regular inf...
متن کاملGeneralized Quantifiers
We review recent work in the field of generalized quantifiers on finite models. We give an idea of the methods that are available in this area. Main emphasis is on definability issues, such as whether there is a logic for the PTIME properties of unordered finite models.
متن کاملIs it logical to count on quantifiers? Dissociable neural networks underlying numerical and logical quantifiers.
The present study examined the neural substrate of two classes of quantifiers: numerical quantifiers like "at least three" which require magnitude processing, and logical quantifiers like "some" which can be understood using a simple form of perceptual logic. We assessed these distinct classes of quantifiers with converging observations from two sources: functional imaging data from healthy adu...
متن کاملNegation and Generalized Quantifiers
Linguistic research has clearly shown that natural languages exhibit different forms of negation. Foremost among these are sentence negation and predicate negation. In this study, the relationship between both will be discussed. In particular, it wiu be argued that we can give an accurate description of the logical connections between sentence negation and predicate negation by reference to the...
متن کاملClarification and generalized quantifiers
We attempt to show that a classical concern of formal semantics, quantification, interacts in an interesting way with dialogue strategies when viewed from the perspective of our approach to semantics using Type Theory with Records (TTR). TTR analyzes semantic content in terms of structured semantic objects containing subcomponents and we argue that these components influence what a dialogue par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 1995
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/5.2.213