Cargando…
Bounded arithmetic, propositional logic and complexity theory
Discusses the deep connections between logic and complexity theory, and lists a number of intriguing open problems.
Autor principal: | Krajicek, Jan |
---|---|
Lenguaje: | eng |
Publicado: |
Cambridge University Press
1995
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/1625307 |
Ejemplares similares
Ejemplares similares
-
Completeness Theory for Propositional Logics
por: Pogorzelski, Witold A, et al.
Publicado: (2008) -
Towards an arithmetical logic: the arithmetical foundations of logic
por: Gauthier, Yvon
Publicado: (2015) -
Gentzen Calculi for Modal Propositional Logic
por: Poggiolesi, Francesca
Publicado: (2011) -
Conference on Applications of Logic to Algebra and Arithmetic
por: Pacholski, Leszek, et al.
Publicado: (1980) -
Meaning and proscription in formal logic: variations on the propositional logic of William T. Parry
por: Ferguson, Thomas Macaulay
Publicado: (2017)