Back to Results
First PageMeta Content
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

Document Date: 2009-05-22 03:48:32


Open Document

File Size: 97,80 KB

Share Result on Facebook