The search for Minimal Search: A graph-theoretic approach

This paper examines Minimal Search, an operation that is at the core of current Minimalist inquiry. We argue that, given assumptions about structure building consisting unordered set-formation, there are serious difficulties in defining Search as a search algorithm. Furthermore, some problematic configurations for (namely, {XP, YP} and {X, Y}) argued to be artefact these set-theoretic commitments. However, if sets up format structural descriptions favour directed graphs such Merge(X, Y) creates arc from X Y, can straightforwardly characterised sequential deterministic algorithm: total order required define MS algorithm provided by building.