البيان رقم صفر

Home

❯

The complexity of theorem-proving procedures

The complexity of theorem-proving procedures

Cook, Stephen A., ‘Complexity’: ‘The complexity of theorem-proving procedures’, Proceedings of the third annual ACM symposium on Theory of computing, 1971, pp 151–158.

conference paper · https://doi.org/10.1145/800157.805047


Backlinks

Thesis. The asymptotics of language

1 August 2026

Note. Some varieties of idealisation

27 April 2026