Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Provability, Complexity, Grammars
 
Lev Beklemishev Steklov Institute of Mathematics, Moscow, Russia
Mati Pentus Moscow State University, Moscow, Russia
Nikolai Vereshchagin Moscow State University, Moscow, Russia
Provability, Complexity, Grammars
Hardcover ISBN:  978-0-8218-1078-1
Product Code:  TRANS2/192
List Price: $175.00
MAA Member Price: $157.50
AMS Member Price: $140.00
eBook ISBN:  978-1-4704-3403-8
Product Code:  TRANS2/192.E
List Price: $165.00
MAA Member Price: $148.50
AMS Member Price: $132.00
Hardcover ISBN:  978-0-8218-1078-1
eBook: ISBN:  978-1-4704-3403-8
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
Provability, Complexity, Grammars
Click above image for expanded view
Provability, Complexity, Grammars
Lev Beklemishev Steklov Institute of Mathematics, Moscow, Russia
Mati Pentus Moscow State University, Moscow, Russia
Nikolai Vereshchagin Moscow State University, Moscow, Russia
Hardcover ISBN:  978-0-8218-1078-1
Product Code:  TRANS2/192
List Price: $175.00
MAA Member Price: $157.50
AMS Member Price: $140.00
eBook ISBN:  978-1-4704-3403-8
Product Code:  TRANS2/192.E
List Price: $165.00
MAA Member Price: $148.50
AMS Member Price: $132.00
Hardcover ISBN:  978-0-8218-1078-1
eBook ISBN:  978-1-4704-3403-8
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 Details
     
     
    American Mathematical Society Translations - Series 2
    Volume: 1921999; 172 pp
    MSC: 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.

    Readership

    Researchers 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
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Volume: 1921999; 172 pp
MSC: 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.

Readership

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
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.