Encoding phases using commutativity and non-commutativity in a logical framework

DOI10.1007/978-3-642-22221-4_1MaRDI QIDQ3010332zbMATH OpenOpenAlexFDO

Authors Maxime Amblard

Publication date 1 July 2011

Published in Logical Aspects of Computational Linguistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1108.5027

zbMATH Keywords

generative theorylinguistic modelingpartially commutative logicphasesyntaxtype theory

Mathematics Subject Classification ID

Logic of natural languages (03B65) Linguistics (91F20)

Abstract: This article presents an extension of Minimalist Categorial Gram- mars (MCG) to encode Chomsky's phases. These grammars are based on Par- tially Commutative Logic (PCL) and encode properties of Minimalist Grammars (MG) of Stabler. The first implementation of MCG were using both non- commutative properties (to respect the linear word order in an utterance) and commutative ones (to model features of different constituents). Here, we pro- pose to adding Chomsky's phases with the non-commutative tensor product of the logic. Then we could give account of the PIC just by using logical prop- erties of the framework.

Recommendations

• Minimalist Grammars and Minimalist Categorial Grammars: Toward Inclusion of Generated Languages
• Rebuilding MP on a logical ground
• Minimalist grammars in the light of logic
• Categorial Grammars and Minimalist Grammars
• Embedding \(\mathsf{HTLCG}\) into \(\mathsf{LCG}_\phi \)

This page was built for publication: Encoding phases using commutativity and non-commutativity in a logical framework

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3010332)