Completely Representable Relation Algebras

DOI10.1093/jigpal/3.1.77zbMath0826.03029OpenAlexW2001031018MaRDI QIDQ4834295

Robin Hirschl

Publication date: 28 November 1995

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0f7cee6fceae99e38086ead5463a79916f854f80

zbMATH Keywords

Boolean algebrarelation algebraelementary classultrapowercomplete representationBoolean reduct

Mathematics Subject Classification ID

Structure theory of Boolean algebras (06E05) Logical aspects of Boolean algebras (03G05) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items

Difference-restriction algebras of partial functions with operators: discrete duality and completion ⋮ Subcompletions of representable relation algebras ⋮ FIRST-ORDER AXIOMATISATIONS OF REPRESENTABLE RELATION ALGEBRAS NEED FORMULAS OF UNBOUNDED QUANTIFIER DEPTH ⋮ Representability is not decidable for finite relation algebras ⋮ POSITIVE FRAGMENTS OF RELEVANCE LOGIC AND ALGEBRAS OF BINARY RELATIONS ⋮ Undecidability of Algebras of Binary Relations

This page was built for publication: Completely Representable Relation Algebras