Cargando…
Provability, complexity, grammars
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 equi...
| Autores principales: | , , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
American Mathematical Society
1999
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/2264266 |
| Sumario: | 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. |
|---|