Complementary Logics for Classical Propositional Languages

Download Edit this record How to cite View on PhilPapers
In previous work, I introduced a complete axiomatization of classical non-tautologies based essentially on Łukasiewicz’s rejection method. The present paper provides a new, Hilbert-type axiomatization (along with related systems to axiomatize classical contradictions, non-contradictions, contingencies and non-contingencies respectively). This new system is mathematically less elegant, but the format of the inferential rules and the structure of the completeness proof possess some intrinsic interest and suggests instructive comparisons with the logic of tautologies.
PhilPapers/Archive ID
Upload history
Archival date: 2015-11-21
View other versions
Added to PP index

Total views
194 ( #32,794 of 65,552 )

Recent downloads (6 months)
15 ( #44,259 of 65,552 )

How can I increase my downloads?

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