Cargando…
Forcing with Random Variables and Proof Complexity
A model-theoretic approach to bounded arithmetic and propositional proof complexity.
Autor principal: | Krajícek, Jan |
---|---|
Lenguaje: | eng |
Publicado: |
Cambridge University Press
2010
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/1437383 |
Ejemplares similares
-
Proof complexity
por: Krajíček, Jan
Publicado: (2019) -
Bounded arithmetic, propositional logic and complexity theory
por: Krajicek, Jan
Publicado: (1995) -
Logical Foundations of Proof Complexity
por: Cook, Stephen, et al.
Publicado: (2010) -
Complex proofs of real theorems
por: Lax, Peter D, et al.
Publicado: (2011) -
Complexity of proofs and their transformations in axiomatic theories
por: Orevkov, V P, et al.
Publicado: (1993)