Tags
Language
Tags
March 2024
Su Mo Tu We Th Fr Sa
25 26 27 28 29 1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30
31 1 2 3 4 5 6

Provability, Complexity, Grammars (American Mathematical Society Translations Series 2)

Posted By: Nice_smile)
Provability, Complexity, Grammars (American Mathematical Society Translations Series 2)

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 outstanding dissertations in mathematical logic and 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 and the Lambek calculus. The dissertation of N. Vereshchagin describes a general framework for criteria of reversability in complexity theory.