1. Arithmetic, Proof theory and computational complexity
Author: edited by Peter Clote and Jan Krajicek
Library: Library of Institute for Research in Fundamental Sciences (Tehran)
Subject: ، Proof theory,، Computational complexity
Classification :
QA
9
.
54
.
A75
![](/design/images/bookmore.png)
![](/design/images/visualshelfbtn.png)
2. Bounded arithmetic, propositional logic, and complexity theory
Author: / Jan Krajicek
Library: Central Library and Document Center of Shahid Chamran University (Khuzestan)
Subject: Constructive mathematics.,Proposition (Logic),Computational complexity.
Classification :
QA
,
9
.
56
,.
K73
,
1995
![](/design/images/bookmore.png)
![](/design/images/visualshelfbtn.png)
3. Bounded arithmetic, propositional logic, and complexity theory
Author: Krajicek, Jan
Library: Library of Institute for Research in Fundamental Sciences (Tehran)
Subject: ، Constructive mathematics,، Proposition )Logic(,، Computational complexity
Classification :
QA
9
.
56
.
K7
![](/design/images/bookmore.png)
![](/design/images/visualshelfbtn.png)
4. Forcing with random variables and proof complexity
Author: Krajicek, Jan
Library: Library of Institute for Research in Fundamental Sciences (Tehran)
Subject: ، Computational complexity,، Random variables,، Mathematical analysis
Classification :
QA
267
.
7
.
K72F6
![](/design/images/bookmore.png)
![](/design/images/visualshelfbtn.png)
5. Proof complexity
Author:
Library: Central Library and Documents Center of Mazandaran University (Mazandaran)
Subject: Proof theory. ; Computational complexity. ;
![](/design/images/bookmore.png)