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

	Description Logics ILCS 2007 Introduction to Logic in Computer Science: Autumn 2007 DocID: 1xVOl - View Document
	Deontic Logic in Computer Science Leon van der Torre & Jörg Hansen ESSLIAugust 2008 DocID: 1uHka - View Document
	αKanren A Fresh Name in Nominal Logic Programming William E. Byrd and Daniel P. Friedman Department of Computer Science, Indiana University, Bloomington, IN 47408 {webyrd,dfried}@cs.indiana.edu DocID: 1ux8H - View Document
	23rd Annual IEEE Symposium on Logic in Computer Science Winning regions of higher-order pushdown games∗ A. Carayol† M. Hague‡ DocID: 1uwn4 - View Document
	Introduction to higher-order computation Nordic Logic School, Stockholm, 2017 Mart´ın H¨otzel Escard´o Theory Group, School of Computer Science University of Birmingham, UK DocID: 1ud4n - View Document