# Minimalist Grammars in the Light of Logic

* Auteur correspondant
1 SIGNES - Linguistic signs, grammar and meaning: computational logic for natural language
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : In this paper, we aim at understanding the derivations of minimalist grammars without the shortest move constraint. This leads us to study the relationship of those derivations with logic. In particular we show that the membership problem of minimalist grammars without the shortest move constraint is as difficult as provability in Multiplicative Exponential Linear Logic. As a byproduct, this result gives us a new representation of those derivations with linear $\lambda$-terms. We show how to interpret those terms in a homomorphic way so as to recover the sentence they analyse. As the homorphisms we describe are rather evolved, we turn to a proof-net representation and explain how Monadic Second Order Logic and related techniques allow us both to define those proof-nets and to retrieve the sentence they analyse.
Type de document :
Rapport
[Research Report] 2011, pp.39

Littérature citée [18 références]

https://hal.inria.fr/inria-00563807
Contributeur : Sylvain Salvati <>
Soumis le : mardi 8 février 2011 - 17:16:41
Dernière modification le : jeudi 11 janvier 2018 - 06:22:13
Document(s) archivé(s) le : mardi 6 novembre 2012 - 13:35:23

### Fichier

syntax.pdf
Fichiers produits par l'(les) auteur(s)

### Identifiants

• HAL Id : inria-00563807, version 1

### Citation

Sylvain Salvati. Minimalist Grammars in the Light of Logic. [Research Report] 2011, pp.39. 〈inria-00563807〉

### Métriques

Consultations de la notice

## 284

Téléchargements de fichiers