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: | Beklemishev, Lev, Pentus, Mati, Vereshchagin, Nikolai |
---|---|
Lenguaje: | eng |
Publicado: |
American Mathematical Society
1999
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/2264266 |
Ejemplares similares
-
The grammar of graphics
por: Wilkinson, Leland
Publicado: (1999) -
Mathematical grammar of biology
por: Yamagishi, Michel Eduardo Beleza
Publicado: (2017) -
Finite automata, their algebras and grammars: towards a theory of formal expressions
por: Büchi, J Richard, et al.
Publicado: (1989) -
Carleman’s formulas in complex analysis: theory and applications
por: Aizenberg, Lev
Publicado: (1993) -
Complexes of differential operators
por: Tarkhanov, Nikolai N
Publicado: (1995)