Definability and Canonicity for Boolean Logic with a Binary Relation

and

https://doi.org/10.3233/FI-2014-973

Abstract

This paper studies the concepts of definability and canonicity in Boolean logic with a binary relation. Firstly, it provides formulas defining first-order or second-order conditions on frames. Secondly, it proves that all formulas corresponding to compatible first-order conditions on frames are canonical.

Keywords

Boolean algebra modal logic definability canonicity

Get full access to this article

View all access options for this article.