This volume contains English translations of three 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. The book is intended for ...
Read More
This volume contains English translations of three 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. The book is intended for researchers and graduate students working in mathematical logic and complexity theory, as well as computer scientists.
Read Less
Add this copy of Provability, Complexity, Grammars (American to cart. $102.00, good condition, Sold by Row by Row Bookshop rated 5.0 out of 5 stars, ships from Sugar Grove, NC, UNITED STATES, published 1999 by American Mathematical Society.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. No Dust Jacket. An ex-library copy in original laminated hard covers, with the usual ex-libris markings. The binding is sound, the text is clean/unmarked, and there is little cover wear. No dust jacket, as issued.
