On the Decidability of Certain Semi-Lattice Based Modal Logics [chapter]

Katalin Bimbó
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
more » ... he decidability of implicational ticket entailment by Bimbó and Dunn in [12, 13] . This paper uses a different adaptation of the same core proof technique to prove a group of positive modal logics (with disjunction but no conjunction) decidable.
doi:10.1007/978-3-319-66902-1_3 fatcat:ccmk2zszmjbcrddy4p36e2zwji