Number of the records: 1

Forcing with Random Variables and Proof Complexity

SYSNO ASEP	0369674
Document Type	B - Monograph
R&D Document Type	Monograph
Title	Forcing with Random Variables and Proof Complexity
Author(s)	Krajíček, Jan (MU-W)_{SAI, ORCID}
Issue data	Cambridge: Cambridge University Press, 2011
ISBN	978-0-521-15433-8
Series	London Mathematical Society Lecture Note Series
Series number	382
Number of pages	247 s.
Number of copy	500
Language	eng - English
Country	GB - United Kingdom
Issue	1st ed.
Keywords	computational complexity ; random variables ; mathematical analysis
Subject RIV	BA - General Mathematics
R&D Projects	IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
	LC505 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
	IAA1019401 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
CEZ	AV0Z10190503 - MU-W (2005-2011)
Annotation	We develop a new method for constructing models of bounded arithmetic and apply it to proof complexity.
Workplace	Mathematical Institute
Contact	Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
Year of Publishing	2012

Number of the records: 1