Access the full text.
Sign up today, get DeepDyve free for 14 days.
Willem Conradie (2009)
Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA
George Gargov, V. Goranko (1993)
Modal logic with namesJournal of Philosophical Logic, 22
P. Blackburn, M. Rijke, Y. Venema (2001)
Modal Logic, 53
Willem Conradie, V. Goranko, D. Vakarelov (2006)
Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMAArXiv, abs/cs/0602024
David Cate (2005)
Model theory for extended modal languages
M. Gehrke, J. Harding, Y. Venema (2005)
MacNeille completions and canonical extensionsIEEE Transactions on Information Theory
B. Cate, maarten marx, Petrucio Viana (2005)
Hybrid logics with Sahlqvist axiomsLog. J. IGPL, 13
M. Gehrke, Hideo Nagahashi, Y. Venema (2005)
A Sahlqvist theorem for distributive modal logicAnn. Pure Appl. Log., 131
P. Blackburn (2000)
Representation, Reasoning, and Relational Structures: a Hybrid Logic ManifestoLog. J. IGPL, 8
J. Benthem (1983)
Modal logic and classical logic
S. Givant, Y. Venema (1999)
The preservation of Sahlqvist equations in completions of Boolean algebras with operatorsalgebra universalis, 41
B. Davey, H. Priestley (1990)
Introduction to lattices and order
J. Benthem (2006)
Modal Frame Correspondences and Fixed-PointsStudia Logica, 83
Areces (2006)
Hybrid logics
N. Kobayashi, Kohei Suenaga, Lucian Wischik (2006)
Resource Usage Analysis for the Pi-CalculusArXiv, abs/cs/0608035
Henrik Sahlqvist (1975)
Completeness and Correspondence in the First and Second Order Semantics for Modal LogicStudies in logic and the foundations of mathematics, 82
V. Goranko, D. Vakarelov (2006)
Elementary canonical formulae: extending Sahlqvist's theoremAnn. Pure Appl. Log., 141
B. Cate (2005)
Interpolation for extended modal languagesJ. Symb. Log., 70
Willem Conradie, Yves Fomatati, A. Palmigiano, Sumit Sourabh (2015)
Algorithmic correspondence for intuitionistic modal mu-calculusTheor. Comput. Sci., 564
Willem Conradie, A. Palmigiano (2012)
Algorithmic correspondence and canonicity for distributive modal logicAnn. Pure Appl. Log., 163
AbstractWe develop a Sahlqvist theory by introducing the class of hybrid inductive formulas. Each hybrid inductive formula is shown to have an effectively calculable first-order local frame correspondent. We define two subclasses, called the nominally skeletal and skeletal hybrid inductive formulas. We show that members of these subclasses are, respectively, preserved under canonical extensions and Dedekind–MacNeille completions of certain hybrid algebras, which is enough to ensure that these formulas axiomatize relationally complete logics. The key methodological tool in proving these results is a hybrid version of the ALBA algorithm, which we formulate and call hybrid-ALBA.
Journal of Logic and Computation – Oxford University Press
Published: Apr 1, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.