Binary Relations and Permutation Groups

Mathematical Logic Quarterly 41 (2):197-216 (1995)
  Copy   BIBTEX

Abstract

We discuss some new properties of the natural Galois connection among set relation algebras, permutation groups, and first order logic. In particular, we exhibit infinitely many permutational relation algebras without a Galois closed representation, and we also show that every relation algebra on a set with at most six elements is Galois closed and essentially unique. Thus, we obtain the surprising result that on such sets, logic with three variables is as powerful in expression as full first order logic

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,745

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-12-01

Downloads
33 (#125,351)

6 months
9 (#1,260,759)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Expressibility of properties of relations.Hajnal Andréka, Ivo Düntsch & István Németi - 1995 - Journal of Symbolic Logic 60 (3):970-991.
On the Homogeneous Countable Boolean Contact Algebra.Ivo Düntsch & Sanjiang Li - 2013 - Logic and Logical Philosophy 22 (2):213-251.

Add more citations