A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On the Decidability of Certain Semi-Lattice Based Modal Logics
[chapter]
2017
Lecture Notes in Computer Science
These are the page proofs of my paper. The version that is published in the proceedings contains multiple typesetting errors (such as missing or replaced symbols) for mysterious reasons. The red page numbers are the page numbers in the volume. Abstract. Sequent calculi are proof systems that are exceptionally suitable for proving the decidability of a logic. Several relevance logics were proved decidable using a technique attributable to Curry and Kripke. Further enhancements led to a proof of
doi:10.1007/978-3-319-66902-1_3
fatcat:ccmk2zszmjbcrddy4p36e2zwji