Undecidability of a Newly Proposed Calculus for CatLog3

摘要

In his recent papers "Parsing/theorem-proving for logical grammar CatLog3" and "A note on movement in logical grammar", Glyn Morrill proposes a new substructural calculus to be used as the basis for the categorial grammar parser CatLog3. In this paper we prove that the derivability problem for a fragment of this calculus is algorithmically undecidable.