2013 | OriginalPaper | Buchkapitel
Some Higher Order Functions on Binary Relations
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Some higher order functions needed in linguistic semantics are studied. Such functions take binary relations or sets and binary relations as arguments and give sets of type 〈1 〉 quantifiers as output. Formal constraints on such functions are generalisations of similar constraints holding for generalised quantifiers and “simple” functions on binary relations. Some theorems concerning such constraints, in particular (generalised) conservativity and cardinality, are proved and some relationships with (Frege) irreducible quantifiers are indicated.