Switch to: References

Add citations

You must login to add citations.
  1. Semantics of the Barwise Sentence: Insights From Expressiveness, Complexity and Inference.Dariusz Kalociński & Michał Tomasz Godziszewski - 2018 - Linguistics and Philosophy 41 (4):423-455.
    In this paper, we study natural language constructions which were first examined by Barwise: The richer the country, the more powerful some of its officials. Guided by Barwise’s observations, we suggest that conceivable interpretations of such constructions express the existence of various similarities between partial orders such as homomorphism or embedding. Semantically, we interpret the constructions as polyadic generalized quantifiers restricted to finite models. We extend the results obtained by Barwise by showing that similarity quantifiers are not expressible in elementary (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Conservativity: A Necessary Property for the Maximization of Witness Sets.L. Robaldo - 2013 - Logic Journal of the IGPL 21 (5):853-878.
  • Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2010 - Linguistics and Philosophy 33 (3):215-250.
    We study the computational complexity of polyadic quantifiers in natural language. This type of quantification is widely used in formal semantics to model the meaning of multi-quantifier sentences. First, we show that the standard constructions that turn simple determiners into complex quantifiers, namely Boolean operations, iteration, cumulation, and resumption, are tractable. Then, we provide an insight into branching operation yielding intractable natural language multi-quantifier expressions. Next, we focus on a linguistic case study. We use computational complexity results to investigate semantic (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  • Quantification in Natural Languages (Volumes I & II), E. Bach, E. Jelinek, A. Kratzer, and B.H. Partee, Eds.Jaap van der Does & Henk Verkuyl - 1999 - Journal of Logic, Language and Information 8 (2):243-251.
  • Normal Forms for Characteristic Functions on N-Ary Relations.Jan van Eijck - unknown
    Functions of type n are characteristic functions on n-ary relations. Keenan [5] established their importance for natural language semantics, by showing that natural language has many examples of irreducible type n functions, i.e., functions of type n that cannot be represented as compositions of unary functions. Keenan proposed some tests for reducibility, and Dekker [3] improved on these by proposing an invariance condition that characterizes the functions with a reducible counterpart with the same behaviour on product relations. The present paper (...)
    No categories
     
    Export citation  
     
    Bookmark   1 citation