Provability, Complexity, Grammars (American Mathematical Society Translations) - Tapa dura

Beklemishev, Lev Dmitrievich; Pentus, Mati Reinovich; Vereshchagin, Nikolai Konstantinovich

 
9780821810781: Provability, Complexity, Grammars (American Mathematical Society Translations)

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.