A Note on the Computational Complexity of the Pure Classical Implication Calculus
暂无分享,去创建一个
We give an interpretation of classical propositional logic in the pure implicational fragment of classical logic
[1] Stephen A. Cook,et al. The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.
[2] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.