Forcing with Random Variables and Proof Complexity.

Forcing with Random Variables and Proof Complexity.

Saved in:
Bibliographic Details
Author / Creator:Krajícek, Jan.
Imprint:Cambridge : Cambridge University Press, 2010.
Description:1 online resource (266 pages)
Language:English
Series:London Mathematical Society Lecture Note Series, 382 ; v. 382
London Mathematical Society Lecture Note Series, 382.
Subject:
Computational complexity.
Random variables.
Mathematical analysis.
Computational complexity.
Mathematical analysis.
Random variables.
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/11830414
Hidden Bibliographic Details
ISBN:9781139117333
1139117335
9781139127998
1139127993
9781139115162
1139115162
9781139107211
1139107216
9780521154338
0521154332
Notes:19 PHP principle.
Includes bibliographical references (pages 236-242) and indexes.
Print version record.
Summary:A model-theoretic approach to bounded arithmetic and propositional proof complexity.
Other form:Print version: Krajícek, Jan. Forcing with Random Variables and Proof Complexity. Cambridge : Cambridge University Press, ©2010 9780521154338
Standard no.:9786613296108

Similar Items