Provability, Complexity, Grammars (American Mathematical Society Translations Series 2) by Mati Reinovich Pentus
English | Apr. 1999 | ISBN: 0821810782 | 172 Pages | DJVU | 2.36 MB
The book contains English translations of three outst&ing dissertations in mathematical logic & complexity theory.
L. Beklemishev proves that all provability logics must belong to one of the four previously known classes. The dissertation of M. Pentus proves the Chomsky conjecture about the equivalence of two approaches to formal languages: the Chomsky hierarchy & the Lambek calculus. The dissertation of N. Vereshchagin describes a general framework for criteria of reversability in complexity theory.