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
“…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.…”
“…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.…”
“…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%
“…It is shown in [11] that any nonprincipal ultraproduct A of the A n 's is representable. By the above definition of Kleene star in A n , it follows that we can define * in the same way in A and that the representation respects * as well.…”
Abstract. We show that there is no finitely axiomatizable class of algebras that would serve as an analogue to Kozen's class of Kleene algebras if we include the residuals of composition in the similarity type of relation algebras.
Let 1 < n < ω and β > n. We show that the class NrnCAβ of n-dimensional neat reducts of β-dimensional cylindric algebras is not closed under forming elementary subalgebras. This solves a long-standing open problem of Tarski and his co-authors Andréka, Henkin, Monk and Németi. The proof uses genuine model-theoretic arguments. Mathematics Subject Classification: 0G15, 03C10.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.