Kripke completeness of strictly positive modal logics over meet-semilattices with operators

Journal of Symbolic Logic 84 (2):533-588 (2019)
  Copy   BIBTEX

Abstract

Our concern is the completeness problem for spi-logics, that is, sets of implications between strictly positive formulas built from propositional variables, conjunction and modal diamond operators. Originated in logic, algebra and computer science, spi-logics have two natural semantics: meet-semilattices with monotone operators providing Birkhoff-style calculi and first-order relational structures (aka Kripke frames) often used as the intended structures in applications. Here we lay foundations for a completeness theory that aims to answer the question whether the two semantics define the same consequence relations for a given spi-logic.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,449

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2019-04-06

Downloads
30 (#787,710)

6 months
4 (#864,415)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Varieties of complex algebras.Robert Goldblatt - 1989 - Annals of Pure and Applied Logic 44 (3):173-242.
An incomplete logic containing S.Kit Fine - 1974 - Theoria 40 (1):23-29.
Positive modal logic.J. Michael Dunn - 1995 - Studia Logica 55 (2):301 - 317.
A Sahlqvist theorem for distributive modal logic.Mai Gehrke, Hideo Nagahashi & Yde Venema - 2004 - Annals of Pure and Applied Logic 131 (1-3):65-102.

View all 14 references / Add more references