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
Revision history
Archival date: 2018-04-21
View upload history
References found in this work BETA

Add more references

Citations of this work BETA

Add more citations

Added to PP index

Total views
20 ( #36,019 of 39,035 )

Recent downloads (6 months)
2 ( #38,857 of 39,035 )

How can I increase my downloads?

Monthly downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.