Number of the records: 1
Forcing with Random Variables and Proof Complexity
- 1.0369674 - MÚ 2012 RIV GB eng B - Monography
Krajíček, Jan
Forcing with Random Variables and Proof Complexity.
1st ed. - Cambridge: Cambridge University Press, 2011. 247 s. London Mathematical Society Lecture Note Series, 382. ISBN 978-0-521-15433-8
R&D Projects: GA AV ČR IAA100190902; GA MŠMT LC505; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : computational complexity * random variables * mathematical analysis
Subject RIV: BA - General Mathematics
http://www.cambridge.org/gb/knowledge/isbn/item5705272/?site_locale=en_GB
We develop a new method for constructing models of bounded arithmetic and apply it to proof complexity.
Permanent Link: http://hdl.handle.net/11104/0203685
Number of the records: 1