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
The following link can be shared to navigate to this page. You can select the link to copy or click the 'Copy To Clipboard' button 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
Front Cover for Provability, Complexity, Grammars
Available Formats:
Hardcover ISBN: 978-0-8218-1078-1
Product Code: TRANS2/192
172 pp 
List Price: $116.00
MAA Member Price: $104.40
AMS Member Price: $92.80
Electronic ISBN: 978-1-4704-3403-8
Product Code: TRANS2/192.E
172 pp 
List Price: $109.00
MAA Member Price: $98.10
AMS Member Price: $87.20
Add to cart
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
List Price: $174.00
MAA Member Price: $156.60
AMS Member Price: $139.20
Add bundle to cart
Front Cover for Provability, Complexity, Grammars
Click above image for expanded view
  • Front Cover for Provability, Complexity, Grammars
  • Back Cover for Provability, Complexity, Grammars
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
Available Formats:
Hardcover ISBN:  978-0-8218-1078-1
Product Code:  TRANS2/192
172 pp 
List Price: $116.00
MAA Member Price: $104.40
AMS Member Price: $92.80
Electronic ISBN:  978-1-4704-3403-8
Product Code:  TRANS2/192.E
172 pp 
List Price: $109.00
MAA Member Price: $98.10
AMS Member Price: $87.20
Add to cart
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
List Price: $174.00
MAA Member Price: $156.60
AMS Member Price: $139.20
Add bundle to cart
  • Book Details
     
     
    American Mathematical Society Translations - Series 2
    Volume: 192; 1999
    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
     
     
    • Cover
    • Title page
    • Copyright page
    • Contents
    • Preface
    • Classification of propositional provability logics
    • Lambek calculus and formal grammars
    • Relativizability in complexity theory
    • Back Cover
  • Reviews
     
     

    • Contains English translations of three outstanding dissertations by Russian mathematicians in mathematical logic, mathematical linguistics, and complexity theory.
      SciTech Book News
  • Request Review Copy
  • Get Permissions
American Mathematical Society Translations - Series 2
Volume: 192; 1999
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.
  • Cover
  • Title page
  • Copyright page
  • Contents
  • Preface
  • Classification of propositional provability logics
  • Lambek calculus and formal grammars
  • Relativizability in complexity theory
  • Back Cover

  • Contains English translations of three outstanding dissertations by Russian mathematicians in mathematical logic, mathematical linguistics, and complexity theory.
    SciTech Book News
Powered by MathJax
Please select which format for which you are requesting permissions.