Algorithmic correspondence and canonicity for distributive modal logic

Annals of Pure and Applied Logic 163 (3):338-376 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,937

External links

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

Through your library

Similar books and articles

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.
Constructive canonicity in non-classical logics.Silvio Ghilardi & Giancarlo Meloni - 1997 - Annals of Pure and Applied Logic 86 (1):1-32.
Maximality in modal logic.R. C. Flagg & H. Friedman - 1987 - Annals of Pure and Applied Logic 34 (2):99-118.
Topology and duality in modal logic.Giovanni Sambin & Virginia Vaccaro - 1988 - Annals of Pure and Applied Logic 37 (3):249-296.
Tangled modal logic for topological dynamics.David Fernández-Duque - 2012 - Annals of Pure and Applied Logic 163 (4):467-481.
Rules with parameters in modal logic II.Emil Jeřábek - 2020 - Annals of Pure and Applied Logic 171 (10):102829.

Analytics

Added to PP
2013-10-27

Downloads
40 (#561,410)

6 months
10 (#407,001)

Historical graph of downloads
How can I increase my downloads?

References found in this work

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.
Constructive canonicity in non-classical logics.Silvio Ghilardi & Giancarlo Meloni - 1997 - Annals of Pure and Applied Logic 86 (1):1-32.

View all 12 references / Add more references