Definability and canonicity for Boolean logic with a binary relation
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...