OATAO - Open Archive Toulouse Archive Ouverte Open Access Week

Definability and canonicity for Boolean logic with a binary relation

Balbiani, Philippe and Tinchev, Tinko Definability and canonicity for Boolean logic with a binary relation. (2014) Fundamenta Informaticae, 129 (4). 301-327. ISSN 0169-2968

[img]
Preview
(Document in English)

PDF (Author's version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
478kB

Official URL: http://dx.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.

Item Type:Article
Additional Information:Thanks to IOS Press editor. The definitive version is available at http://iospress.metapress.com/content/jv0q77v67rmjl727/?issue=4&genre=article&spage=301&issn=0169-2968&volume=129
HAL Id:hal-01120594
Audience (journal):International peer-reviewed journal
Uncontrolled Keywords:
Institution:French research institutions > Centre National de la Recherche Scientifique - CNRS (FRANCE)
Université de Toulouse > Institut National Polytechnique de Toulouse - INPT (FRANCE)
Other partners > Sofia University St. Kliment Ohridski (BULGARIA)
Université de Toulouse > Université Toulouse III - Paul Sabatier - UPS (FRANCE)
Université de Toulouse > Université Toulouse - Jean Jaurès - UT2J (FRANCE)
Université de Toulouse > Université Toulouse 1 Capitole - UT1 (FRANCE)
Laboratory name:
Statistics:download
Deposited By: IRIT IRIT
Deposited On:26 Feb 2015 09:39

Repository Staff Only: item control page