Switch to: References

Add citations

You must login to add citations.
  1. A semantic constraint on binary determiners.R. Zuber - 2009 - Linguistics and Philosophy 32 (1):95-114.
    A type quantifier F is symmetric iff F ( X, X )( Y ) = F ( Y, Y )( X ). It is shown that quantifiers denoted by irreducible binary determiners in natural languages are both conservative and symmetric and not only conservative.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Relational Syllogisms with Numerical Quantifiers and Beyond.Ka-fat Chow - 2021 - Journal of Logic, Language and Information 31 (1):1-34.
    In the first half of this paper, we present a fragment of relational syllogisms named RELSYLL consisting of quantified statements with a special set of numerical quantifiers, and introduce a number of concepts that are useful for the later sections, including indirect reduction, quantifier transformations and equivalence of syllogisms. After determining the valid and invalid syllogisms in RELSYLL, we then introduce two Derivation Methods which can be used to derive valid relational syllogisms based on known valid simple syllogisms. We also (...)
    Download  
     
    Export citation  
     
    Bookmark