论文信息 - Propositional Provability and Models of Weak Arithmetic - 字舞流文

Propositional Provability and Models of Weak Arithmetic

Jan Krajícek | Pavel Pudlák | J. Krajícek | P. Pudlák

[1] Jan Krajícek,et al. Quantified propositional calculi and fragments of bounded arithmetic , 1990, Math. Log. Q..

[2] Armin Haken,et al. The Intractability of Resolution , 1985, Theor. Comput. Sci..

[3] Richard J. Lipton,et al. Some connections between mathematical logic and complexity theory , 1979, STOC.

[4] Stephen A. Cook,et al. The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.

[5] M. Dowd,et al. Propositional representation of arithmetic proofs , 1979 .

[6] Stephen A. Cook,et al. Feasibly constructive proofs and the propositional calculus (Preliminary Version) , 1975, STOC.