Short Proofs of Tautologies using the Schema of Equivalence

In Egon Börger, Yuri Gurevich & Karl Meinke (eds.), Computer Science Logic. 7th Workshop, CSL '93, Swansea. Selected Papers. Berlin: Springer. pp. 33-35 (1994)
Download Edit this record How to cite View on PhilPapers
Abstract
It is shown how the schema of equivalence can be used to obtain short proofs of tautologies A , where the depth of proofs is linear in the number of variables in A .
Categories
(categorize this paper)
PhilPapers/Archive ID
BAASPO
Upload history
Archival date: 2017-10-10
View other versions
Added to PP index
2017-10-10

Total views
200 ( #35,324 of 69,983 )

Recent downloads (6 months)
14 ( #49,542 of 69,983 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.