Definability and Canonicity for Boolean Logic with a Binary Relation
Philippe Balbiani, Tinko Tinchev · Fundamenta Informaticae · 2014
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.