Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Balbiani, Philippe | Tinchev, Tinko
Affiliations: Institut de recherche en informatique de Toulouse, CNRS — Université de Toulouse, 118 route de Narbonne, 31062 Toulouse Cedex 9, France. Philippe.Balbiani@irit.fr | Department of Mathematical Logic and Applications, Sofia University, Blvd James Bouchier 5, 1126 Sofia, Bulgaria. tinko@fmi.uni-sofia.bg
Note: [] Address for correspondence: Institut de recherche en informatique de Toulouse, CNRS — Université de Toulouse, 118 route de Narbonne, 31062 Toulouse Cedex 9, France
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
DOI: 10.3233/FI-2014-973
Journal: Fundamenta Informaticae, vol. 129, no. 4, pp. 301-327, 2014
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl