Results 1 -
3 of
3
Rebuilding MP on a Logical Ground
"... We provide a logical system to express Minimalist Grammars, which aims at being "minimal" in the sense that it contains the least rules and the simplest lexical entries as possible. By limiting ourselves to the proofs in that system that satisfy some simple 'economy'-criterion, ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
We provide a logical system to express Minimalist Grammars, which aims at being "minimal" in the sense that it contains the least rules and the simplest lexical entries as possible. By limiting ourselves to the proofs in that system that satisfy some simple 'economy'-criterion, we may obtain exactly the same derivations as those obtained by Stabler.
Abstract Derivations as Proofs a Logical Approach to Minimalism
"... The purpose of this paper is to show that we can work in the spirit of minimalist grammars by means of a labelled commutative (and associative) calculus (Oehrle’s Mon:LP), enriched with constraints on the use of assumptions. Lexical entries are considered proper axioms, some of which are coupled wit ..."
Abstract
- Add to MetaCart
(Show Context)
The purpose of this paper is to show that we can work in the spirit of minimalist grammars by means of a labelled commutative (and associative) calculus (Oehrle’s Mon:LP), enriched with constraints on the use of assumptions. Lexical entries are considered proper axioms, some of which are coupled with (sequences of) hypotheses which must necessarily be introduced and discharged before the use of their associated axiom. Like similar proposals by P. de Groote or R. Muskens, our calculus has two interfaces. Each of them provides a homomorphism of types (from syntactic types to semantic ones, or �-types, and from syntactic types to phonetic ones, or �-types). Move is simply the link between a hypothesis A and its lifted type (A�X)�X when a �(or �)-term of the later type applies to a piece of proof the last step of which consists in precisely discharging A. The ability for a phrase to overtly move is governed by the form of its �-term. Moreover, the elimination rule for ª is used to simulate head-movements. An enrichment with the exponential of Linear Logic: ”! ” is also proposed in order to treat binding phenomena in the spirit of Kayne (2003). We see that this enrichment opens the field to new insights concerning ellipsis and coordination. Proximity with other formalisms like Lambda grammars and Abstract Categorial Grammars is discussed. Key words: minimalist grammars, type-logical grammars, logical form, Curry-Howard, binding phenomena 1
(Multimodal) Categorial Grammar and Minimalist Program: some reflexions and comparisons
"... Several proposals have been made in order to implement some aspects of the Minimalist Program (and among them Stabler’s minimalist grammars) logically. Among these proposals, we compare W.Vermaat’s thesis and a previous paper of the author. Then we confront these works with the new perspective broug ..."
Abstract
- Add to MetaCart
(Show Context)
Several proposals have been made in order to implement some aspects of the Minimalist Program (and among them Stabler’s minimalist grammars) logically. Among these proposals, we compare W.Vermaat’s thesis and a previous paper of the author. Then we confront these works with the new perspective brought by Lecomte and Retoré, which seems to gain in clarity by separating the syntactic and the semantic components. 1