Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. A proper hierarchy of propositional sequent calculi;Arai;Theoret. Comput. Sci.,1996
2. N. Arai, Cut-free LK quasi-polynomially simulates resolution, preprint FI-CXT1998-001, The Fields Institute for Research in Mathematical Sciences, University of Toronto, Canada, 1998.
3. Hyper tableaux;Baumgartner,1996
4. S.A. Cook, R. Reckhow, On the lengths of proofs in the propositional calculus, Proc. 6th ACM Symp. on Theory of Computing (STOC-74), 1974, pp. 135–148. See corrections in SIGACT News, 6 (1974) 15–22. Extended version in [5].
5. The relative efficiency of propositional proof systems;Cook;J. Symbolic Logic,1979
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The complexity of analytic tableaux;Journal of Symbolic Logic;2006-09