Weakly representable but not representable relation algebras
A relation algebra \((A,+,\cdot, ^ -, 0,1,\circ, \breve{\;}, 1 {\text{'}})\) is said to be representable (weakly representable) if it is representable as an algebra of binary relations, where all of its operations (except perhaps \(+\) and \(^ -\)) have their natural set- theoretic meaning, i.e., union, intersection, complementation, empty set, biggest set, relation composition, inverse or converse and identity relation, respectively. The main theorem of this paper states that the class of representable relation algebras is not finitely axiomatizable over the class of weakly representable relation algebras, i.e., no finite set of first order formulas can be added to the axioms of the latter class so as to obtain a system of axioms for the former class. This implies in particular the existence of the algebras in the title of the paper, thus answering a question raised by B. Jónsson.
- Weak representations of relation algebras and relational bases
- Weakly representable relation algebras form a variety
- On the variety question for wRRA
- A simple construction of representable relation algebras with non-representable completions
- Weakly representable atom structures that are not strongly representable, with an application to first order logic
- Algebraization of quantifier logics, an introductory overview
- Axiomatization of identity-free equations valid in relation algebras
- Combinatorial Relations and Chromatic Graphs
- Nonfinite axiomatizability results for cylindric and relation algebras
- Nonfinitizability of classes of representable cylindric algebras
- Representation of Modular Lattices and Of Relation Algebras
- Some sufficient conditions for the representability of relation algebras
- Splitting in Relation Algebras
- Representations of additive relation algebras by modules
- Algebraization of quantifier logics, an introductory overview
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- Weakly associative relation algebras with polyadic composition operations
- On the equational complexity of RRA
- Representability of Lyndon-Maddux relation algebras
- Nonrepresentable relation algebras generated by functional elements
- Weakly representable relation algebras form a variety
- Bifunctional-elementary relation algebras
- Representability is not decidable for finite relation algebras
- Representability of pairing relation algebras depends on your ontology
- Weak representations of relation algebras and relational bases
- Weakly representable atom structures that are not strongly representable, with an application to first order logic
- A simple construction of representable relation algebras with non-representable completions
- Omitting types for algebraizable extensions of first order logic
- Decidability of Relation Algebras with Weakened Associativity
- scientific article; zbMATH DE number 67031 (Why is no real title available?)
- scientific article; zbMATH DE number 67033 (Why is no real title available?)
- scientific article; zbMATH DE number 67045 (Why is no real title available?)
- Step by step – Building representations in algebraic logic
- scientific article; zbMATH DE number 1984508 (Why is no real title available?)
- Completely Representable Relation Algebras
- Undecidability of representability as binary relations
- Weakening Relation Algebras and FL^2-algebras
- First-order axiomatisations of representable relation algebras need formulas of unbounded quantifier depth
- Lattice-Based Relation Algebras II
- On canonicity and completions of weakly representable relation algebras
- Finite Symmetric Integral Relation Algebras with No 3-Cycles
- There is no finite-variable equational axiomatization of representable relation algebras over weakly representable relation algebras
This page was built for publication: Weakly representable but not representable relation algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337158)
