Proving unprovability in some normal modal logics

Bulletin of the Section of Logic 20 (1):23-29 (1991)
Download Edit this record How to cite View on PhilPapers
This note considers deductive systems for the operator a of unprovability in some particular propositional normal modal logics. We give thus complete syntactic characterization of these logics in the sense of Lukasiewicz: for every formula  either `  or a  (but not both) is derivable. In particular, purely syntactic decision procedure is provided for the logics under considerations.
PhilPapers/Archive ID
Upload history
Archival date: 2018-04-21
View other versions
Added to PP index

Total views
51 ( #50,937 of 2,426,000 )

Recent downloads (6 months)
2 ( #59,137 of 2,426,000 )

How can I increase my downloads?

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