Relation Algebra with binders
| Venue: | Journal of Logic and Computation, Vol 11 Nr |
| Citations: | 4 - 1 self |
BibTeX
@ARTICLE{Marx_relationalgebra,
author = {Maarten Marx},
title = {Relation Algebra with binders},
journal = {Journal of Logic and Computation, Vol 11 Nr},
year = {},
volume = {11},
pages = {691--700}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The language of relation algebras is expanded with variables denoting individual elements in the domain and with the ↓ binder from hybrid logic. Every elementary property of binary relations is expressible in the resulting language, something which fails for the relation algebraic language. That the new language is natural for speaking about binary relations is indicated by the fact that both Craig’s Interpolation, and Beth’s Definability theorems hold for its set of validities. The paper contains a number of worked out examples.
Citations
| 94 | M.: Hybrid logics: Characterization, interpolation and complexity - Areces, Blackburn, et al. - 2001 |
| 70 | Internalizing labelled deduction - Blackburn |
| 70 | relational structures: a hybrid logic manifesto - Blackburn, Representation - 2000 |
| 21 | Beth’s and Craig’s properties via epimorphisms and amalgamation in algebraic logic - Sain |
| 10 | without the Amalgamation Property - Comer - 1969 |
| 9 | Relation algebras with n-dimensional relational bases", manuscript - Hirsch, Hodkinson - 1997 |
| 6 | Fork algebras in algebra, logic and computer science - Frias - 2002 |
| 6 | Amalgamation in relation algebras - Marx - 1998 |
| 2 | Problems of expresibility in finite languages - Kwatinetz - 1981 |
