Complexity of equations valid in algebras of relations. I: Strong non-finitizability
type: Item
instance of: scholarly article
title: Complexity of equations valid in algebras of relations. I: Strong non-finitizability
zbMATH Open document ID: 0898.03023
DOI: 10.1016/S0168-0072(97)00027-4
published in: Annals of Pure and Applied Logic
publication date: 1998-11-01T00:00:00Z
review text: This article is reviewed together with Part II below: ibid. 89, No. 2-3, 211-229 (1997; Zbl 0898.03024).
Mathematics Subject Classification ID: 03G15
zbMATH DE Number: 1109907
zbMATH Keywords: relation algebras
zbMATH Keywords: equational axiomatization
zbMATH Keywords: cylindric algebras
zbMATH Keywords: polyadic algebras
zbMATH Keywords: varieties
zbMATH Keywords: axiomatizability
zbMATH Keywords: representable algebras
author: Hajnal Andréka
MaRDI profile type: Publication
cites work: On taking subalgebras of relativized relation algebras
cites work: One variable is not enough for defining relation algebras, but two are
cites work: Representations of distributive lattice-ordered semigroups with binary relations
cites work: Weakly representable but not representable relation algebras
cites work: The equational theory of union-free algebras of relations
cites work: Epimorphisms in cylindric algebras and definability in finite variable logic
cites work: Q3684178
cites work: Notions of density that imply representability in algebraic logic
cites work: The lattice of varieties of representable relation algebras
cites work: A unifying theorem for algebraic semantics and dynamic logics
cites work: Free algebras in discriminator varieties
cites work: Splitting in Relation Algebras
cites work: Q3998034
cites work: A simple, purely algebraic proof of the completeness of some first order logics
cites work: On systems of varieties definable by schemes of equations
cites work: Dimension-complemented and locally finite dimensional cylindric algebras are elementarily equivalent
cites work: Axiomatization of identity-free equations valid in relation algebras
cites work: Q4789455
cites work: Q4011707
cites work: Q4143373
cites work: Q4011708
cites work: Isomorphic but not lower base-isomorphic cylindric algebras of finite dimension
cites work: Non-finite-axiomatizability results in algebraic logic
cites work: Isomorphic but not lower base-isomorphic cylindric set algebras
cites work: Algebraizable logics
cites work: One-generated clones of operations on binary relations
cites work: Q4948643
cites work: Q3816132
cites work: Representations of ordered semigroups and lattices by binary relations
cites work: Galois Theory for Cylindric Algebras and its Applications
cites work: Q3744162
cites work: Q4011713
cites work: A remark of representable positive cylindric algebras
cites work: Q3350830
cites work: Q4273425
cites work: Logic in algebraic form. Three languages and theories
cites work: Q4111008
cites work: Lawvere's elementary theories and polyadic and cylindric algebras
cites work: Q3748269
cites work: Copeland algebras
cites work: Algebras and their subalgebras
cites work: Q4273434
cites work: Q4318638
cites work: Cylindric algebras with terms
cites work: On inducing homomorphisms between relation set algebras
cites work: Measures on cylindric algebras
cites work: Propositional dynamic logic of regular programs
cites work: The Structure of Relation Algebras Generated by Relativizations
cites work: Varieties of complex algebras
cites work: Combinatorial Relations and Chromatic Graphs
cites work: Arguesian lattices which are not linear
cites work: POLYADIC BOOLEAN ALGEBRAS
cites work: Q5537331
cites work: Q3282928
cites work: Q4873971
cites work: Q3259696
cites work: Extending Boolean operations
cites work: Q4063140
cites work: Cylindric algebras. Part II
cites work: Cylindric set algebras. Cylindric set algebras and related structures. By L. Henkin, J. D. Monk, and A. Tarski. On cylindric-relativized set algebras. By H. Andreka and I. Nemeti
cites work: Q5732648

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: A proof system for the first-order relational calculus

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Step by step – Building representations in algebraic logic

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q5680125

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: The relational model of data and cylindric algebras

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Definability with bounded number of bound variables

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Adjoining units to residuated Boolean algebras

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Nonfinitizability of classes of representable polyadic algebras

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Representation of Modular Lattices and Of Relation Algebras

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Varieties of relation algebras

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q3337519

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4011720

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q3939782

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q3897035

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q3958436

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q3358736

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: The representation of relation algebras. II

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Relation algebras and projective geometries

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4390777

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Non-embeddable simple relation algebras

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Nonfinite axiomatizability results for cylindric and relation algebras

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Canonical Relativized Cylindric Set Algebras

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Finitary Algebraic Logic

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: The Neat Embedding Problem and the Number of Variables Required in Proofs

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: The origin of relation algebras in the development and axiomatization of the calculus of relations

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Stone duality for first order logic

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q3126000

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Taming logic

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4032851

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: On the representation theory for cylindric algebras

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: On representable relation algebras

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Nonfinitizability of classes of representable cylindric algebras

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: On an algebra of sets of finite sequences

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4111007

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q3674662

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4749182

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Every free algebra in the variety generated by the representable dynamic algebras is separable and representable

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: On varieties of cylindric algebras with applications to logic

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4273476

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4887108

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4698615

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Representability of pairing relation algebras depends on your ontology

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: On the equational theory of representable polyadic equality algebras

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Weakly higher order cylindric algebras and finite axiomatization of the representables

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: On the chromatic number of certain highly symmetric graphs

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Cylindric Algebras and Algebras of Substitutions

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4011729

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4284038

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Dynamic algebras: Examples, constructions, applications

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4273477

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Substitution algebras in their relation to cylindric algebras

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q5596826

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4873976

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: On the search for a finitizable algebraization of first order logic

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Finite schematizable algebraic logic

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4011731

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Relation algebras and function semigroups

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4011733

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4041054

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q3695284

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4011736

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4040000

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4273440

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Dynamic algebras with test

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: GENERAL DYNAMICS

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4285787

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q4735171

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Cylindric modal logic

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Representation of ordered semigroups

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Boolean Algebras with Operators

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (cites work)
cites work: Q5810602

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (full work available at URL)
full work available at URL: s0168-0072(97)00027-4

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (OpenAlex ID)
OpenAlex ID: W2013191336

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (Recommended article)
Recommended article: Complexity of equations valid in algebras of relations. II: Finite axiomatizations
Similarity Score: 0.96422076
Recommender Run: Recommender Run 3

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (Recommended article)
Recommended article: On the Complexity of the Equational Theory of Relational Action Algebras
Similarity Score: 0.89471793
Recommender Run: Recommender Run 3

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (Recommended article)
Recommended article: Complexity of equational theory of relational algebras with standard projection elements
Similarity Score: 0.88250124
Recommender Run: Recommender Run 3

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (Recommended article)
Recommended article: Q4032851
Similarity Score: 0.8817705
Recommender Run: Recommender Run 3

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (Recommended article)
Recommended article: Q4443193
Similarity Score: 0.8808676
Recommender Run: Recommender Run 3

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (Recommended article)
Recommended article: The equational complexity of Lyndon's algebra
Similarity Score: 0.88053375
Recommender Run: Recommender Run 3

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (Recommended article)
Recommended article: Axiomatization of identity-free equations valid in relation algebras
Similarity Score: 0.8787542
Recommender Run: Recommender Run 3

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (Recommended article)
Recommended article: On the Complexity of the Equational Theory of Residuated Boolean Algebras
Similarity Score: 0.87842304
Recommender Run: Recommender Run 3

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (Recommended article)
Recommended article: On computation complexity problems concerning relation algebras
Similarity Score: 0.878073
Recommender Run: Recommender Run 3

Complexity of equations valid in algebras of relations. I: Strong non-finitizability (Recommended article)
Recommended article: Q4890394
Similarity Score: 0.87469006
Recommender Run: Recommender Run 3