Hardcover ISBN:  9780821810781 
Product Code:  TRANS2/192 
List Price:  $175.00 
MAA Member Price:  $157.50 
AMS Member Price:  $140.00 
eBook ISBN:  9781470434038 
Product Code:  TRANS2/192.E 
List Price:  $165.00 
MAA Member Price:  $148.50 
AMS Member Price:  $132.00 
Hardcover ISBN:  9780821810781 
eBook: ISBN:  9781470434038 
Product Code:  TRANS2/192.B 
List Price:  $340.00 $257.50 
MAA Member Price:  $306.00 $231.75 
AMS Member Price:  $272.00 $206.00 
Hardcover ISBN:  9780821810781 
Product Code:  TRANS2/192 
List Price:  $175.00 
MAA Member Price:  $157.50 
AMS Member Price:  $140.00 
eBook ISBN:  9781470434038 
Product Code:  TRANS2/192.E 
List Price:  $165.00 
MAA Member Price:  $148.50 
AMS Member Price:  $132.00 
Hardcover ISBN:  9780821810781 
eBook ISBN:  9781470434038 
Product Code:  TRANS2/192.B 
List Price:  $340.00 $257.50 
MAA Member Price:  $306.00 $231.75 
AMS Member Price:  $272.00 $206.00 

Book DetailsAmerican Mathematical Society Translations  Series 2Volume: 192; 1999; 172 ppMSC: Primary 68; 03
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.
ReadershipResearchers and graduate student working in mathematical logic and complexity theory; computer scientists.

Table of Contents

Chapters

L. D. Beklemishev — Classification of propositional provability logics

Mati Pentus — Lambek calculus and formal grammars

Nikolai K. Vereshchagin — Relativizability in complexity theory


Reviews

Contains English translations of three outstanding dissertations by Russian mathematicians in mathematical logic, mathematical linguistics, and complexity theory.
SciTech Book News


RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Reviews
 Requests
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.
Researchers and graduate student working in mathematical logic and complexity theory; computer scientists.

Chapters

L. D. Beklemishev — Classification of propositional provability logics

Mati Pentus — Lambek calculus and formal grammars

Nikolai K. Vereshchagin — Relativizability in complexity theory

Contains English translations of three outstanding dissertations by Russian mathematicians in mathematical logic, mathematical linguistics, and complexity theory.
SciTech Book News