Old and New Minimalism: a Hopf algebra comparison

06/17/2023
by   Matilde Marcolli, et al.
0

In this paper we compare some old formulations of Minimalism, in particular Stabler's computational minimalism, and Chomsky's new formulation of Merge and Minimalism, from the point of view of their mathematical description in terms of Hopf algebras. We show that the newer formulation has a clear advantage purely in terms of the underlying mathematical structure. More precisely, in the case of Stabler's computational minimalism, External Merge can be described in terms of a partially defined operated algebra with binary operation, while Internal Merge determines a system of right-ideal coideals of the Loday-Ronco Hopf algebra and corresponding right-module coalgebra quotients. This mathematical structure shows that Internal and External Merge have significantly different roles in the old formulations of Minimalism, and they are more difficult to reconcile as facets of a single algebraic operation, as desirable linguistically. On the other hand, we show that the newer formulation of Minimalism naturally carries a Hopf algebra structure where Internal and External Merge directly arise from the same operation. We also compare, at the level of algebraic properties, the externalization model of the new Minimalism with proposals for assignments of planar embeddings based on heads of trees.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/29/2023

Mathematical Structure of Syntactic Merge

The syntactic Merge operation of the Minimalist Program in linguistics c...
research
12/01/2019

Purpose-based access policy on provenance and data algebra

It is a crucial mechanism of access control to determine that data can o...
research
07/16/2018

What is algebraic about algebraic effects and handlers?

This note recapitulates and expands the contents of a tutorial on the ma...
research
04/01/2023

Logic is Algebra

Logic really is just algebra, given one uses the right kind of algebra, ...
research
06/16/2009

Mnesors for automatic control

Mnesors are defined as elements of a semimodule over the min-plus intege...
research
11/20/2022

The Internal Operads of Combinatory Algebras

We argue that operads provide a general framework for dealing with polyn...
research
09/15/2023

Merging two Hierarchies of Internal Contextual Grammars with Subregular Selection

In this paper, we continue the research on the power of contextual gramm...

Please sign up or login with your details

Forgot password? Click here to reset