Finite algebras of relations are representable on finite sets

Journal of Symbolic Logic 64 (1):243-267 (1999)
  Copy   BIBTEX

Abstract

Using a combinatorial theorem of Herwig on extending partial isomorphisms of relational structures, we give a simple proof that certain classes of algebras, including Crs, polyadic Crs, and WA, have the `finite base property' and have decidable universal theories, and that any finite algebra in each class is representable on a finite set

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

External links

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

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
31 (#443,123)

6 months
2 (#658,980)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Relation algebras from cylindric algebras, I.Robin Hirsch & Ian Hodkinson - 2001 - Annals of Pure and Applied Logic 112 (2-3):225-266.
Guards, Bounds, and generalized semantics.Johan van Benthem - 2005 - Journal of Logic, Language and Information 14 (3):263-279.
Weakly associative relation algebras with projections.Agi Kurucz - 2009 - Mathematical Logic Quarterly 55 (2):138-153.
First order logic without equality on relativized semantics.Amitayu Banerjee & Mohamed Khaled - 2018 - Annals of Pure and Applied Logic 169 (11):1227-1242.

View all 8 citations / Add more citations

References found in this work

Add more references