البيان رقم صفر

Home

❯

refs

❯

Computational complexity of polyadic lifts of generalized quantifiers in natural language

Computational complexity of polyadic lifts of generalized quantifiers in natural language

Szymanik, Jakub, ‘Computational complexity of polyadic lifts of generalized quantifiers in natural language’, Linguistics and Philosophy 33.3 (1 June 2010), pp 215–250.

journal article · https://doi.org/10.1007/s10988-010-9076-z


Graph View

Backlinks

  • Jakub Szymanik
  • Linguistics and Philosophy