Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

Definability and canonicity for Boolean logic with a binary relation

Philippe Balbiani 1, 2 Tinko Tinchev 3 
1 IRIT-LILaC - Logique, Interaction, Langue et Calcul
IRIT - Institut de recherche en informatique de Toulouse
2 CNRS - Centre National de la Recherche Scientifique
3 Department of Mathematical Logic and Applications (Sofia, Bulgaria)
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
Document type :
Journal articles
Complete list of metadata

Cited literature [31 references]  Display  Hide  Download
https://hal.archives-ouvertes.fr/hal-01120594
Contributor : Open Archive Toulouse Archive Ouverte (OATAO) Connect in order to contact the contributor
Submitted on : Thursday, February 26, 2015 - 10:09:18 AM
Last modification on : Monday, July 4, 2022 - 9:19:57 AM
Long-term archiving on: : Wednesday, May 27, 2015 - 10:45:35 AM

File

Vignette du document
Balbiani_12876.pdf
Files produced by the author(s)

Identifiers

Collections

UNIV-TLSE2 | CNRS | SMS | UT1-CAPITOLE | IRIT | IRIT-LILAC | IRIT-IA | UNIV-UT3 | UT3-TOULOUSEINP

Citation

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

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

32

Files downloads

110