论文信息 - Fragments of bounded arithmetic and the lengths of proofs - 字舞流文

Fragments of bounded arithmetic and the lengths of proofs

[1] P. Pudlák. Chapter VIII - The Lengths of Proofs , 1998 .

[2] R. Statman. Bounds for proof-search and speed-up in the predicate calculus , 1978 .

[3] Jan Krajícek,et al. On induction-free provability , 2005, Annals of Mathematics and Artificial Intelligence.

[4] Jan Krajícek,et al. Bounded Arithmetic and the Polynomial Hierarchy , 1991, Ann. Pure Appl. Log..

[5] Jan Krajíček. No Counter-Example Interpretation and Interactive Computation , 1992 .

[6] Jirí Hanika. Herbrandizing search problems in Bounded Arithmetic , 2004, Math. Log. Q..

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

[8] S. Buss,et al. An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic , 1994 .

[9] Stefan Hetzl,et al. Describing proofs by short tautologies , 2009, Ann. Pure Appl. Log..