Finite algebras of relations are representable on finite sets

Journal of Symbolic Logic 64 (1):243-267 (1999)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2586762
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,810
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Weakly Associative Relation Algebras with Projections.Agi Kurucz - 2009 - Mathematical Logic Quarterly 55 (2):138-153.
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.
The Semijoin Algebra and the Guarded Fragment.Dirk Leinders, Maarten Marx, Jerzy Tyszkiewicz & Jan Van den Bussche - 2005 - Journal of Logic, Language and Information 14 (3):331-343.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
17 ( #293,695 of 2,202,780 )

Recent downloads (6 months)
1 ( #301,722 of 2,202,780 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature