Scopeless quantifiers and operators
This article is about characterizations of the variable-binding operators \(F\) satisfying the equations (S) for arbitrary operators \(G\) and functions \(\phi\) of suitable types: \[ (Fx)\;(Gy)\;\phi(x,y)=(Gy)\;(Fx)\;\phi(x,y).\tag{S} \] In the case of unary generalized quantifiers \(G\) and binary relations \(\phi\), (S) is shown to be satisfied by exactly the ultrafilters with a certain completeness property, which in many cases amounts to principality. This result is extended to arbitrary operators occurring in functional type hierarchies, of which some examples are briefly discussed. The final section of the paper gives a characterization of scopeless operators that do not involve variable- binding. The appendix contains an application of one of the results to natural language semantics, viz. the analysis of infinitive embedding verbs of perception.
- Scope dominance with monotone quantifiers over finite domains
- Directions in generalized quantifier theory
- Relational syllogisms with numerical quantifiers and beyond
- Scope dominance with upward monotone quantifiers
- scientific article; zbMATH DE number 638368 (Why is no real title available?)
- Self-commuting quantifiers
- On Barwise and Cooper’s “Generalized Quantifiers and Natural Language”
- Operators vs quantifiers
- On quantification and extensionality
- Functional quantification
- Computing scope dominance with upward monotone quantifiers
This page was built for publication: Scopeless quantifiers and operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689081)