Sahlqvist theory for impossible worlds

@article{Palmigiano2017SahlqvistTF,
  title={Sahlqvist theory for impossible worlds},
  author={Alessandra Palmigiano and Sumit Sourabh and Zhiguang Zhao},
  journal={J. Log. Comput.},
  year={2017},
  volume={27},
  pages={775-816}
}
We extend unified correspondence theory to Kripke frames with impossible worlds and their associated regular modal logics. These are logics the modal connectives of which are not required to be normal: only the weaker properties of additivity ◊x∨◊y=◊(x∨y) and multiplicativity □x∧□y=□(x∧y) are required. Conceptually, it has been argued that their lacking necessitation makes regular modal logics better suited than normal modal logics at the formalization of epistemic and deontic settings. From a… 

Figures and Tables from this paper

Algorithmic Correspondence and Canonicity for Possibility Semantics (Abstract)
TLDR
A uniform and modular theory which subsumes the above results and extends them to logics with a non-classical propositional base has emerged, and has been dubbed unified correspondence.
Correspondence and canonicity in non-classical logic
In this thesis we study correspondence and canonicity for non-classical logic using algebraic and order-topological methods. Correspondence theory is aimed at answering the question of how precisely
Algorithmic correspondence and canonicity for possibility semantics
TLDR
The present paper proves the soundness of the algorithm with respect to both full possibility frames and filter-descriptive possibility frames, and uses the algorithm to give an alternative proof to the one in the work by Holliday (2016, Possibility frames and forcing for modal logic).
Algorithmic Correspondence , Canonicity and Completeness for Possibility Semantics
TLDR
The present paper aims at giving a closer look at the aforementioned unsolved problems using the algebraic and order-theoretic insights from a current ongoing research project, namely unified correspondence.
Unified Correspondence as a Proof-Theoretic Tool
TLDR
The present paper aims at establishing formal connections between correspondence phenomena, well known from the area of modal logic, and the theory of display calculi, originated by Belnap, and applies unified correspondence theory, with its tools and insights, to extend Kracht's results and prove his claims in the setting of DLE-logics.
Logics with Impossibility as the Negation and Regular Extensions of the Deontic Logic D2
In [1] J.-Y. Beziau formulated a logic called Z. Beziau’s idea was generalized independently in [6] and [7]. A family of logics to which Z belongs is denoted in [7] by K. In particular; it has been
Correspondence, Canonicity, and Model Theory for Monotonic Modal Logics
We investigate the role of coalgebraic predicate logic , a logic for neighborhood frames first proposed by Chang, in the study of monotonic modal logics. We prove analogues of the Goldblatt–Thomason
Algebraic and Proof-Theoretic Foundations of the Logics for Social Behaviour
TLDR
The results and methodologies developed in this thesis pave the way to the logical modelling of the inner workings of organizations and their dynamics, and of social phenomena such as reputational Matthew effects and bank runs.
Canonicity and Relativized Canonicity via Pseudo-Correspondence: an Application of ALBA
TLDR
This work defines a suitable enhancement of the algorithm ALBA, which is used to prove the canonicity of certain syntactically defined classes of DLE-inequalities (called the meta-inductive inequalities), relative to the structures in which the formulas asserting the additivity of some given terms are valid.
...
...

References

SHOWING 1-10 OF 46 REFERENCES
A Sahlqvist theorem for distributive modal logic
Monotonic modal logics
Monotonic modal logics form a generalisation of normal modal logics in which the additivity of the diamond modality has been weakened to monotonicity: 3p∨3q → 3(p∨q). This generalisation means that
Unified Correspondence as a Proof-Theoretic Tool
TLDR
The present paper aims at establishing formal connections between correspondence phenomena, well known from the area of modal logic, and the theory of display calculi, originated by Belnap, and applies unified correspondence theory, with its tools and insights, to extend Kracht's results and prove his claims in the setting of DLE-logics.
Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
TLDR
This paper introduces a new algorithm, SQEMA, for computing first-order equiva- lents (using a modal version of Ackermann's lemma) and proves its correctness and the canonicity of all formulae on which the algorithm succeeds, establishing one of the most general completeness results in modal logic so far.
Elementary canonical formulae: extending Sahlqvist's theorem
Algorithmic correspondence and canonicity for distributive modal logic
Canonicity and Relativized Canonicity via Pseudo-Correspondence: an Application of ALBA
TLDR
This work defines a suitable enhancement of the algorithm ALBA, which is used to prove the canonicity of certain syntactically defined classes of DLE-inequalities (called the meta-inductive inequalities), relative to the structures in which the formulas asserting the additivity of some given terms are valid.
Unified correspondence and proof theory for strict implication
TLDR
Gentzen-style cut-free sequent calculi for BDFNL and its extensions with analytic rules which are transformed from strict implication sequents, are developed.
...
...