Definability and canonicity for Boolean logic with a binary relation - Archive ouverte HAL Access content directly
Journal Articles Fundamenta Informaticae Year : 2014

Definability and canonicity for Boolean logic with a binary relation

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.
Fichier principal
Vignette du fichier
Balbiani_12876.pdf (467.05 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01120594 , version 1 (26-02-2015)

Identifiers

Cite

Philippe Balbiani, Tinko Tinchev. Definability and canonicity for Boolean logic with a binary relation. Fundamenta Informaticae, 2014, vol. 129 (n° 4), pp. 301-327. ⟨10.3233/FI-2014-973⟩. ⟨hal-01120594⟩
45 View
181 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More