Linear Lower Bounds and Simulations in Frege Systems with Substitutions
暂无分享,去创建一个
[1] Samuel R. Buss,et al. The deduction rule and linear and near-linear proof simulations , 1993, Journal of Symbolic Logic.
[2] J. Roger Hindley,et al. Principal type-schemes and condensed detachment , 1990, Journal of Symbolic Logic.
[3] Jan Kraj mIček. On the number of steps in proofs , 1989 .
[4] Alasdair Urquhart. The number of lines in Frege proofs with substitution , 1997, Arch. Math. Log..
[5] Jean H. Gallier,et al. Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .
[6] Rohit Parikh. Some results on the length of proofs , 1973 .
[7] N. Campbell. Formal Logic. , 1931, Nature.
[8] S. Feferman. Lectures on proof theory , 1968 .
[9] Stephen A. Cook,et al. The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.
[10] Gonzalo Navarro,et al. Bounding the Expected Length of Longest Common Subsequences and Forests , 1999, Theory of Computing Systems.
[11] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.
[12] Samuel R. Buss,et al. How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus , 1994, CSL.
[13] Jan Krajícek,et al. Propositional proof systems, the consistency of first order theories and the complexity of computations , 1989, Journal of Symbolic Logic.
[14] Samuel R. Buss,et al. Some remarks on lengths of propositional proofs , 1995, Arch. Math. Log..
[15] Paul M. B. Vitányi,et al. An Introduction to Kolmogorov Complexity and Its Applications , 1993, Graduate Texts in Computer Science.
[16] Toniann Pitassi,et al. Exponential Lower Bounds for the Tree-Like Hajós Calculus , 1995, Inf. Process. Lett..