1989
DOI: 10.2307/2274756
|View full text |Cite
|
Sign up to set email alerts
|

Nonfinite axiomatizability results for cylindric and relation algebras

Abstract: The set of equations which use only one variable and hold in all representable relation algebras cannot be derived from any finite set of equations true in all representable relation algebras. Similar results hold for cylindric algebras and for logic with finitely many variables. The main tools are a construction of nonrepresentable one-generated relation algebras, a method for obtaining cylindric algebras from relation algebras, and the use of relation algebras in defining algebraic semantics for first-order … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
61
0

Year Published

2002
2002
2021
2021

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 60 publications
(61 citation statements)
references
References 7 publications
0
61
0
Order By: Relevance
“…In a number of publications, including notably [5,6] and the survey [7], Maddux gave a new way of constructing cylindric algebras of any dimension from atomic relation algebras, using sets of networks called cylindric bases. We will continue to simplify things by restricting consideration to finite simple relation algebras.…”
Section: Maddux: Cylindric Basesmentioning
confidence: 99%
See 1 more Smart Citation
“…In a number of publications, including notably [5,6] and the survey [7], Maddux gave a new way of constructing cylindric algebras of any dimension from atomic relation algebras, using sets of networks called cylindric bases. We will continue to simplify things by restricting consideration to finite simple relation algebras.…”
Section: Maddux: Cylindric Basesmentioning
confidence: 99%
“…The question of connections between algebras of different arities (and perhaps varying in other features too) is of interest in its own right. It has a distinguished history, including work of Monk [8] and Maddux [5][6][7]. It raises intricate technical challenges.…”
Section: Introductionmentioning
confidence: 99%
“…The construction in [7] is rather involved, since we needed dense algebras (where x ≤ x;x is valid) so that they can be applied to relevance logic. A simpler construction is available from [11] that has been used to show nonfinite axiomatizability of the equational theories of some residuated algebras in [12]. The Kleene star operation was not considered in [12], but it can be easily added to the signature.…”
Section: Action Latticesmentioning
confidence: 99%
“…We recall the main features of the algebras A n = (A n , −, ·, +, ;, , 0, 1 , 1) of [11]. A n has the following atoms (minimal, nonzero elements): identity 1 , q i for 1 ≤ i ≤ m, and p j for 1 ≤ j ≤ n with m = 3 · n!.…”
Section: Action Latticesmentioning
confidence: 99%
See 1 more Smart Citation