On the Complexity of Abstract Categorial Grammars In this abstract we investigate the respective complexities of the membership and the universal membership problems for Abstract Categorial Grammars [dG01]. This problem

First Page		Document Content
Date: 2009-05-22 03:48:32 Logic in computer science Theoretical computer science Mathematics Constructible universe Mathematical logic CurryHoward correspondence Table of stars with Bayer designations Generalised Whitehead product		On the Complexity of Abstract Categorial Grammars In this abstract we investigate the respective complexities of the membership and the universal membership problems for Abstract Categorial Grammars [dG01]. This problem Add to Reading List Source URL: wwwhomes.uni-bielefeld.de Download Document from Source Website File Size: 97,80 KB Share Document on Facebook