Cargando…

Forcing with Random Variables and Proof Complexity

A model-theoretic approach to bounded arithmetic and propositional proof complexity.

Detalles Bibliográficos
Autor principal: Krajícek, Jan
Lenguaje:eng
Publicado: Cambridge University Press 2010
Materias:
Acceso en línea:http://cds.cern.ch/record/1437383
_version_ 1780924518570655744
author Krajícek, Jan
author_facet Krajícek, Jan
author_sort Krajícek, Jan
collection CERN
description A model-theoretic approach to bounded arithmetic and propositional proof complexity.
id cern-1437383
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 2010
publisher Cambridge University Press
record_format invenio
spelling cern-14373832021-04-22T00:34:04Zhttp://cds.cern.ch/record/1437383engKrajícek, JanForcing with Random Variables and Proof ComplexityMathematical Physics and MathematicsA model-theoretic approach to bounded arithmetic and propositional proof complexity.Cambridge University Pressoai:cds.cern.ch:14373832010
spellingShingle Mathematical Physics and Mathematics
Krajícek, Jan
Forcing with Random Variables and Proof Complexity
title Forcing with Random Variables and Proof Complexity
title_full Forcing with Random Variables and Proof Complexity
title_fullStr Forcing with Random Variables and Proof Complexity
title_full_unstemmed Forcing with Random Variables and Proof Complexity
title_short Forcing with Random Variables and Proof Complexity
title_sort forcing with random variables and proof complexity
topic Mathematical Physics and Mathematics
url http://cds.cern.ch/record/1437383
work_keys_str_mv AT krajicekjan forcingwithrandomvariablesandproofcomplexity