skip to main
|
skip to sidebar
Lambda Calculus and Formal Grammar
Random notes on logic, language, and computation
Sep 15, 2014
PSPACE-completeness of LCFRS universal recognition
›
About a month ago, Marco Kuhlmann asked on twitter whether the universal recognition problem for non-permuting LCFRSs is PSPACE-complete....
Dec 3, 2013
Machine-Based Approach to Pumping
›
(January 1, 2014: The statement of "Harrison's theorem" in the original post was in error. The error is now corrected. See h...
1 comment :
Dec 20, 2010
Incompleteness via Tarski's Theorem
›
Many textbooks, including the one I'm using , present an "easy" proof of Gödel's First Incompleteness Theorem via Tarski...
May 22, 2010
Labeled Bracketings and the Chomsky-Schützenberger Theorem
›
I always thought that the Chomsky-Schützenberger Theorem is an easy consequence of the fact that for every CFG G , the strings generated by...
Mar 26, 2010
Mathematical Logic and Computability
›
I'll be teaching logic to graduate students in philosophy this coming semester. The textbook I'll use is H. Jerome Keisler et al....
Mar 2, 2010
Kit Fine's situation semantics
›
Kit Fine gave an invited talk at the Third Interdisciplinary Ontology Conference on Sunday, titled "A State-Based Approach to the Fram...
Home
View web version
About Me
Makoto Kanazawa
View my complete profile