Logical Foundations of Proof Complexity || THE THEORY V 1 AND POLYNOMIAL TIME
- 作者Cook, Stephen; Nguyen, Phuong
- 文件大小295.72KB
- 发表时间2010
- DOI10.1017/CBO9780511676277.007
- 页码133-158
Logical Foundations of Proof Complexity || PROOF SYSTEMS AND THE REFLECTION PRINCIPLECook, Stephen; Nguyen, Phuong · 2010
Logical Foundations of Proof Complexity || THE PREDICATE CALCULUS AND THE SYSTEM LKCook, Stephen; Nguyen, Phuong · 2010
Logical Foundations of Proof Complexity || THE THEORY V 1 AND POLYNOMIAL TIMECook, Stephen; Nguyen, Phuong · 2010
[Studies in Logic and the Foundations of Mathematics] Computability, Complexity, Logic Volume 128 || Chapter E Logical Analysis of the Concept of Proof, · 1989
Logical Foundations of Proof Complexity || PREFACECook, Stephen; Nguyen, Phuong · 2010
Logical Foundations of Proof Complexity || INTRODUCTIONCook, Stephen; Nguyen, Phuong · 2010
Logical Foundations of Proof Complexity || BIBLIOGRAPHYCook, Stephen; Nguyen, Phuong · 2010
Logical Foundations of Proof Complexity || PROPOSITIONAL TRANSLATIONSCook, Stephen; Nguyen, Phuong · 2010
Logical Foundations of Proof Complexity || COMPUTATION MODELSCook, Stephen; Nguyen, Phuong · 2010
Relativizing small complexity classes and their theoriesAehlig, Klaus; Cook, Stephen; Nguyen, Phuong · computational complexity · 2016
Logical Foundations of Proof Complexity || THEORIES FOR SMALL CLASSESCook, Stephen; Nguyen, Phuong · 2010
The Complexity of Proving the Discrete Jordan Curve TheoremNguyen, Phuong; Cook, Stephen · ACM Transactions on Computational Logic · 2012