The representation of relational algebras

From MaRDI portal
Publication:2648517

DOI10.2307/1969375zbMath0037.29302OpenAlexW3145287507MaRDI QIDQ2648517

Roger C. Lyndon

Publication date: 1950

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1969375



Related Items

Bjarni Jónsson's contributions in algebra, A perspective on the theory of relation algebras, Weak representations of relation algebras and relational bases, Leon Henkin the Reviewer, Reducts of relation algebras: the aspects of axiomatisability and finite representability, Representations for small relation algebras, Relation algebras and groups, Subcompletions of representable relation algebras, The logic of Peirce algebras, General geometric lattices and projective geometry of modules, RELEVANCE LOGICS AND RELATION ALGEBRAS, From points to intervals, Finite, integral, and finite-dimensional relation algebras: A brief history, Relation algebras of intervals, Embedding modular lattices into relation algebras, Atom structures of cylindric algebras and relation algebras, The lattice of varieties of representable relation algebras, Fuzzy Krasner \((m,n)\)-hyperrings., Alfred Tarski's work in model theory, Alfred Tarski and undecidable theories, FIRST-ORDER AXIOMATISATIONS OF REPRESENTABLE RELATION ALGEBRAS NEED FORMULAS OF UNBOUNDED QUANTIFIER DEPTH, A proof system for the first-order relational calculus, Seurat games on Stockmeyer graphs, A construction of cylindric and polyadic algebras from atomic relation algebras, Relation algebras of every dimension, FINITE RELATION ALGEBRAS, The contributions of Alfred Tarski to general algebra, Some Varieties Containing Relation Algebras, Boolean modules, Completeness for flat modal fixpoint logics, Step by step – Building representations in algebraic logic, Representability is not decidable for finite relation algebras, Relation algebras of Sugihara, Belnap, Meyer, and Church, Programs as partial graphs. I: Flow equivalence and correctness, Undecidability of representability as binary relations, Tractable approximations for temporal constraint handling, Complete representations in algebraic logic, The origin of relation algebras in the development and axiomatization of the calculus of relations, Pair-Dense Relation Algebras, A Completeness Result for Relation Algebra with Binders, Reasoning with Graphs, Goals and benchmarks for automated map reasoning, Multigroups, Multigroups, The contributions of Alfred Tarski to algebraic logic, Layered map reasoning, A CHOREOGRAPHIC ROBOT VISION MODEL, Strongly representable atom structures of relation algebras, Ehresmann theory and partition monoids, Axiomatizing the logical core of XPath 2.0, Relation algebras and their application in temporal and spatial reasoning, Relation algebras from cylindric algebras. I, On graph reasoning, Some sufficient conditions for the representability of relation algebras, Canonical varieties with no canonical axiomatisation, Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups, Algebraic Logic, Where Does it Stand Today?, Inequivalent representations of geometric relation algebras, Relation algebras and function semigroups, Relational proof systems for spatial reasoning ★, RALL: Machine-supported proofs for relation algebra, Nonfinite axiomatizability results for cylindric and relation algebras, Unifying threads in Alfred Tarski's work, Arrows Pointing at Arrows: Arrow Logic, Relevance Logic, and Relation Algebras, Relation algebras: Concept of points and representability, Equational Reasoning in Non-Classical Logics, Identities in Two-Valued Calculi, The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom, Tarskian Classical Relevant Logic, Interpretability of first-order linear temporal logics in fork algebras