Exploració per tema "Lambek calculus"

Ara es mostren els items 1-3 de 3

    • A count invariant for Lambek calculus with additives and bracket modalities 

      Valentín Fernández Gallart, José Oriol; Serret, Daniel; Morrill, Glyn (Springer-Verlag Berlin Heidelberg, 2013)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      The count invariance of van Benthem (1991) is that for a sequent to be a theorem of the Lambek calculus, for each atom, the number of positive occurrences equals the number of negative occurrences. (The same is true ...

    • A polynomial-time algorithm for the Lambek calculus with brackets of bounded order 

      Kanovich, Max; Kuznetsov, Stepan; Morrill, Glyn; Scedrov, Andre (Dagstuhl Publishing, 2017)
      Text en actes de congrés
      Accés obert
      Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a polynomial-time algorithm for determining provability of bounded depth ...

    • Overtly anaphoric control in type logical grammar 

      Corbalán, María Inés; Morrill, Glyn (Springer, 2016)
      Text en actes de congrés
      Accés obert
      In this paper we analyse anaphoric pronouns in control sentences and we investigate the implications of these kinds of sentences in relation to the Propositional Theory versus Property Theory question. For these purposes, ...