Coordination and binary branching

Bibliographic Data

ID3159456
AuthorsAdam Przepiórkowski (0000-0002-4398-2636, Institute of Computer Science Polish Academy of Sciences Warszawa Poland, corresponding author)
Year2024
Volume27
Issue3
Pages589-612
Publication date2024-03-08
Peer ReviewedYes
Open AccessYes
TypeARTICLE
VenueSyntax (JOURNAL)
Journal identifiersISSN: 1368-0005 • E-ISSN: 1467-9612
PublisherWiley (PUBLISHER • GB)
DOI10.1111/synt.12285
OpenAlexW4392620784
LanguageEN
Citations received2
References cited35

In "Subordination and Binary Branching", a recent (2023) Syntax paper, Ad Neeleman and colleagues proposed a new analysis of subordination. The main aim of this paper is to refute that analysis, using data from the coordination of unlike categories and unlike grammatical functions. Additionally, building on Neeleman et al.'s observations about the arbitrarily -ary-not just binary-nature of coordination, I sketch a more Minimalist approach to subordination and coordination that is devoid of the problems that Neeleman et al.'s analysis faces, but otherwise covers a similar range of data. On this approach, "subordination" is a synonym of "result of PairMerge" and "coordination" is a synonym of "result of SetMerge", where SetMerge is understood as an operation creating an arbitrary set, as opposed to the usual more specialized Merge operation, which creates a binary set

Algorithm · Arithmetic · Binary number · Binary relation · Branching (polymer chemistry · Discrete mathematics · Information retrieval · Linguistics · Merge (version control · Programming language · Set (abstract data type · Sketch · Subordination (linguistics · Syntax · Computer Science · Mathematics · Natural Language Processing Techniques · Philosophy · semigroups and automata theory · Syntax, Semantics, Linguistic Variation · Artificial Intelligence

Tools

Open DOI