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.

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Finite algebras of relations are representable on finite sets.H. Andréka, I. Hodkinson & I. Németi - 1999 - Journal of Symbolic Logic 64 (1):243-267.
The Isomorphism Testing For Directly Representable Varieties.Tomasz Gorazd - 1997 - Reports on Mathematical Logic:75-92.
Bare canonicity of representable cylindric and polyadic algebras.Jannis Bulian & Ian Hodkinson - 2013 - Annals of Pure and Applied Logic 164 (9):884-906.
Step by step – Building representations in algebraic logic.Robin Hirsch & Ian Hodkinson - 1997 - Journal of Symbolic Logic 62 (1):225-279.
Decidability of Cylindric Set Algebras of Dimension Two and First-Order Logic with Two Variables.Maarten Marx & Szabolcs Mikulas - 1999 - Journal of Symbolic Logic 64 (4):1563-1572.
Decidability of cylindric set algebras of dimension two and first-order logic with two variables.Maarten Marx & Szabolcs Mikulás - 1999 - Journal of Symbolic Logic 64 (4):1563-1572.
Notions of density that imply representability in algebraic logic.Hajnal Andréka, Steven Givant, Szabolcs Mikulás, István Németi & András Simon - 1998 - Annals of Pure and Applied Logic 91 (2-3):93-190.
On the equational theory of representable polyadic equality algebras.István Németi & Gábor Sági - 2000 - Journal of Symbolic Logic 65 (3):1143-1167.
Atom structures of cylindric algebras and relation algebras.Ian Hodkinson - 1997 - Annals of Pure and Applied Logic 89 (2):117-148.
Lower Semilattice-Ordered Residuated Semigroups and Substructural Logics.Szabolcs Mikulás - 2015 - Studia Logica 103 (3):453-478.
Finite schematizable algebraic logic.I. Sain & V. Gyuris - 1997 - Logic Journal of the IGPL 5 (5):699-751.
Omitting types for finite variable fragments and complete representations of algebras.Hajnal Andréka, István Németi & Tarek Sayed Ahmed - 2008 - Journal of Symbolic Logic 73 (1):65-89.
Weak representations of relation algebras and relational bases.Robin Hirsch, Ian Hodkinson & Roger D. Maddux - 2011 - Journal of Symbolic Logic 76 (3):870 - 882.
Characteristic Formulas of Partial Heyting Algebras.Alex Citkin - 2013 - Logica Universalis 7 (2):167-193.
Representations for Small Relation Algebras.Hajnal Andréka & Roger D. Maddux - 1994 - Notre Dame Journal of Formal Logic 35 (4):550-562.

Analytics

Added to PP
2017-02-21

Downloads
7 (#1,310,999)

6 months
1 (#1,444,594)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Guards, Bounds, and generalized semantics.Johan van Benthem - 2005 - Journal of Logic, Language and Information 14 (3):263-279.
First order logic without equality on relativized semantics.Amitayu Banerjee & Mohamed Khaled - 2018 - Annals of Pure and Applied Logic 169 (11):1227-1242.
Arrow logic and infinite counting.Ágnes Kurucz - 2000 - Studia Logica 65 (2):199-222.

Add more citations

References found in this work

No references found.

Add more references