Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A count invariant for Lambek calculus with additives and bracket modalities

Autor
Valentin Fernandez, J.; Serret, D.; Morrill, G.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
18th International Conference on Formal Grammar
Any de l'edició
2013
Data de presentació
2013-08
Llibre d'actes
Proceedings of the 18th International Conference on Formal Grammar
Pàgina inicial
263
Pàgina final
276
Editor
Springer-Verlag Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-642-39998-5_17 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/20347 Obrir en finestra nova
URL
http://link.springer.com/chapter/10.1007%2F978-3-642-39998-5_17 Obrir en finestra nova
Resum
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 for multiplicative linear logic.) The count invariance provides for extensive pruning of the sequent proof search space. In this paper we generalize count invariance to categorial grammar (or linear logic) with additives and bracket modalities. We define by mutual recursion two count...
Citació
Valentin Fernandez, J.; Serret, D.; Morrill, G. A count invariant for Lambek calculus with additives and bracket modalities. A: Formal Grammar. "Proceedings of the 18th International Conference on Formal Grammar". Dusseldorf: Springer-Verlag Berlin Heidelberg, 2013, p. 263-276.
Paraules clau
Categorial grammar, Lambek calculus, Linear logic, Multiplicative linear logic, Mutual recursion, Proof search
Grup de recerca
LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge

Participants

  • Valentin Fernandez Gallart, Jose Oriol  (autor ponent)
  • Serret, Daniel  (autor ponent)
  • Morrill, Glyn Verden  (autor ponent)