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
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 52,893
Through your library

References found in this work BETA

Add more references

Citations of this work BETA

First Order Logic Without Equality on Relativized Semantics.Amitayu Banerjee & Mohamed Khaled - 2018 - Annals of Pure and Applied Logic 169 (11):1227-1242.
Relation Algebras From Cylindric Algebras, I.Robin Hirsch & Ian Hodkinson - 2001 - Annals of Pure and Applied Logic 112 (2-3):225-266.
Weakly Associative Relation Algebras with Projections.Agi Kurucz - 2009 - Mathematical Logic Quarterly 55 (2):138-153.

View all 7 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
25 ( #396,605 of 2,343,166 )

Recent downloads (6 months)
1 ( #515,062 of 2,343,166 )

How can I increase my downloads?

Downloads

My notes