Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Supporting your high street Find out how »
Provability, Complexity, Grammars, Hardback Book

Provability, Complexity, Grammars Hardback

Part of the American Mathematical Society Translations series

Hardback

Item not Available

Description

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.

Information

£107.00

Item not Available
Item not Available
Sign in to add to wishlist
 
Free Home Delivery

on all orders

 
Pick up orders

from local bookshops

Information

Also in the American Mathematical Society Translations series  |  View all

Problems of Reducing the Exhaustive...

£153.00

Add to Basket

Proceedings of the St. Petersburg...

£153.00

Add to Basket

Topics in Statistical and Theoretical...

£153.00

Add to Basket

Dynamical Systems in Classical Mechanics

£153.00

Add to Basket