Search
Now showing items 1-4 of 4
Characterization, definability and separation via saturated models
(2014)
Three important results about the expressivity of a modal logic L are the Characterization Theorem (that identifies a modal logic L as a fragment of a better known logic), the Definability theorem (that provides conditions ...
Completeness in hybrid type theory
(2014)
We show that basic hybridization (adding nominals and @ operators) makes it possible to give straightforward Henkin-style completeness proofs even when the modal logic being hybridized is higher-order. The key ideas are ...
Modal satisfiability via SMT solving
(2015)
Modal logics extend classical propositional logic, and they are robustly decidable. Whereas most existing decision procedures for modal logics are based on tableau constructions, we propose a framework for obtaining decision ...
Swap logic
(2014)
We investigate dynamic modal operators that can change the model during evaluation. We define the logic SL by extending the basic modal language with the ♦ modality, which is a diamond operator that in addition has the ...