A note on the computational complexity of the pure classical implication calculus

https://doi.org/10.1016/0020-0190(89)90086-0Get rights and content

References (2)

  • S.A. Cook

    The complexity of theorem-proving procedures

    Proc. 3rd Ann. ACM Symp. on the Theory of Computing

    (1971)
  • S.A. Cook et al.

    The relative efficiency of propositional proof systems

    J. Symbolic Logic

    (1979)

Cited by (5)

View full text