Axiomatizability of reducts of algebras of relations

2000 ◽  
Vol 43 (2-3) ◽  
pp. 127-156 ◽  
Author(s):  
Ian Hodkinson ◽  
Szabolcs Mikul�s
Keyword(s):  
Algebras Of Relations

On Algebras of Relations with Operations of Left and Right Reflexive Product

2020 ◽  
Vol 41 (2) ◽  
pp. 160-167 ◽  
Author(s):  
D. A. Bredikhin
Keyword(s):  
Algebras Of Relations ◽  
Left And Right

Representation of Residuated Semigroups in Some Algebras of Relations (The Method of Canonical Models)

1997 ◽  
Vol 31 (1) ◽  
pp. 1-12 ◽  
Author(s):  
Wojciech Buszkowski ◽  
Mirosława Kołowska-Gawiejnowicz
Keyword(s):  
Canonical Models ◽  
Algebras Of Relations

scholarly journals Expressibility of properties of relations

1995 ◽  
Vol 60 (3) ◽  
pp. 970-991 ◽  
Author(s):  
Hajnal Andréka ◽  
Ivo Düntsch ◽  
István Németi
Keyword(s):  
Algebraic Setting ◽  
Algebras Of Relations

AbstractWe investigate in an algebraic setting the question of which logical languages can express the properties integral, permutational, and rigid for algebras of relations.

scholarly journals Undecidable relativizations of algebras of relations

1999 ◽  
Vol 64 (2) ◽  
pp. 747-760 ◽  
Author(s):  
Szabolcs Mikulás ◽  
Maarten Marx
Keyword(s):  
Order Logic ◽  
First Order Logic ◽  
Similarity Type ◽  
First Order ◽  
Equational Theories ◽  
Algebras Of Relations ◽  
Guarded Fragment ◽  
Cylindric Set Algebras

AbstractIn this paper we show that relativized versions of relation set algebras and cylindric set algebras have undecidable equational theories if we include coordinatewise versions of the counting operations into the similarity type. We apply these results to the guarded fragment of first-order logic.

scholarly journals On algebras of relations

1993 ◽  
Vol 28 (1) ◽  
pp. 191-199 ◽  
Author(s):  
D. Bredikhin
Keyword(s):  
Algebras Of Relations

Finite algebras of relations are representable on finite sets

1999 ◽  
Vol 64 (1) ◽  
pp. 243-267 ◽  
Author(s):  
H. Andréka ◽  
I. Hodkinson ◽  
I. Németi
Keyword(s):  
Simple Proof ◽  
Finite Algebra ◽  
Finite Sets ◽  
Base Property ◽  
Finite Algebras ◽  
Relational Structures ◽  
Combinatorial Theorem ◽  
Finite Base ◽  
Algebras Of Relations ◽  
Finite Set

AbstractUsing 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.

scholarly journals Complexity of equations valid in algebras of relations part II: Finite axiomatizations

1997 ◽  
Vol 89 (2-3) ◽  
pp. 211-229 ◽  
Author(s):  
Hajnal Andréka
Keyword(s):  
Algebras Of Relations

scholarly journals Generators for algebras of relations

1976 ◽  
Vol 82 (5) ◽  
pp. 781-783 ◽  
Author(s):  
A. R. Bednarek ◽  
S. M. Ulam
Keyword(s):  
Algebras Of Relations

Other approaches to algebras of relations

2002 ◽  
pp. 199-212
Author(s):  
Robin Hirsch ◽  
Ian Hodkinson
Keyword(s):  
Algebras Of Relations

scholarly journals Complexity of equations valid in algebras of relations part I: Strong non-finitizability

1997 ◽  
Vol 89 (2-3) ◽  
pp. 149-209 ◽  
Author(s):  
Hajnal Andréka
Keyword(s):  
Algebras Of Relations
Sign in / Sign up

Export Citation Format

Share Document