- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Algorithmic correspondence and canonicity for distributive modal logic
Annals of Pure and Applied Logic 163 (3):338-376 (2012)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Modal correspondence for models.Jon Barwise & Lawrence S. Moss - 1998 - Journal of Philosophical Logic 27 (3):275-294.
Simulating polyadic modal logics by monadic ones.George Goguadze, Carla Piazza & Yde Venema - 2003 - Journal of Symbolic Logic 68 (2):419-462.
Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames.A. V. Chagrov & L. A. Chagrova - 1995 - Studia Logica 55 (3):421 - 448.
A proof-theoretic study of the correspondence of classical logic and modal logic.H. Kushida & M. Okada - 2003 - Journal of Symbolic Logic 68 (4):1403-1414.
Modal logic from Kant to possible worlds semantics.Tapio Korte, Ari Maunu & Tuomo Aho - 2011 - In Leila Haaparanta (ed.), The development of modern logic. New York: Oxford University Press.
Modal logic.Alexander Chagrov - 1997 - New York: Oxford University Press. Edited by Michael Zakharyaschev.
On canonicity and strong completeness conditions in intermediate propositional logics.Silvio Ghilardi & Pierangelo Miglioli - 1999 - Studia Logica 63 (3):353-385.
Sahlqvist Correspondence for Modal mu-calculus.Johan Benthem, Nick Bezhanishvili & Ian Hodkinson - 2012 - Studia Logica 100 (1-2):31-60.
A modal view of linear logic.Simone Martini & Andrea Masini - 1994 - Journal of Symbolic Logic 59 (3):888-899.
Algorithmic logic. Multiple-valued extensions.Helena Rasiowa - 1979 - Studia Logica 38 (4):317 - 335.
Analytics
Added to PP
2013-10-27
Downloads
25 (#616,937)
6 months
4 (#790,687)
2013-10-27
Downloads
25 (#616,937)
6 months
4 (#790,687)
Historical graph of downloads
Citations of this work
Algorithmic correspondence and canonicity for non-distributive logics.Willem Conradie & Alessandra Palmigiano - 2019 - Annals of Pure and Applied Logic 170 (9):923-974.
Algebraic proof theory for substructural logics: cut-elimination and completions.Agata Ciabattoni, Nikolaos Galatos & Kazushige Terui - 2012 - Annals of Pure and Applied Logic 163 (3):266-290.
Modal and temporal extensions of non-distributive propositional logics.Chrysafis Hartonas - 2016 - Logic Journal of the IGPL 24 (2):156-185.
Algebraic proof theory: Hypersequents and hypercompletions.Agata Ciabattoni, Nikolaos Galatos & Kazushige Terui - 2017 - Annals of Pure and Applied Logic 168 (3):693-737.
Algebraic semantics and model completeness for Intuitionistic Public Announcement Logic.Minghui Ma, Alessandra Palmigiano & Mehrnoosh Sadrzadeh - 2014 - Annals of Pure and Applied Logic 165 (4):963-995.
References found in this work
Elementary canonical formulae: extending Sahlqvist’s theorem.Valentin Goranko & Dimiter Vakarelov - 2006 - Annals of Pure and Applied Logic 141 (1):180-217.
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.
Canonical Extensions and Relational Completeness of Some Substructural Logics.J. Michael Dunn, Mai Gehrke & Alessandra Palmigiano - 2005 - Journal of Symbolic Logic 70 (3):713 - 740.
Constructive canonicity in non-classical logics.Silvio Ghilardi & Giancarlo Meloni - 1997 - Annals of Pure and Applied Logic 86 (1):1-32.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-pp8v9 uwo