Simple Closures

Steven Givant and Hajnal Andréka
Additional contact information
Steven Givant: Mills College, Department of Mathematics
Hajnal Andréka: Alfréd Rényi Institute of Mathematics, Institute of Mathematics, Hungarian Academy of Sciences

Chapter Chapter 5 in Simple Relation Algebras, 2017, pp 133-188 from Springer

Abstract: Abstract Every relation algebra can be constructed from simple relation algebras, because every relation algebra is isomorphic to a subdirect product of simple relation algebras. The task of understanding arbitrary relation algebras therefore reduces, in some sense, to the task of understanding simple relation algebras. Rather unexpectedly, it turns out that simple relation algebras are no easier to understand than arbitrary relation algebras. In fact, every relation algebra is a relativization of some (and usually many) simple relation algebras. In other words, for every relation algebra 𝔅 $$\mathfrak{B}$$ , there is a simple relation algebra 𝔄 $$\mathfrak{A}$$ and a reflexive equivalence element e in 𝔄 $$\mathfrak{A}$$ such that 𝔄 ( e ) = 𝔅 $$\mathfrak{A}(e) = \mathfrak{B}$$ . Among the various algebras that might satisfy this condition, it is natural to look for the smallest ones. This minimality condition translates into the requirement that the universe B generate 𝔄 $$\mathfrak{A}$$ . The goal of this chapter is to analyze the ways in which an arbitrary relation algebra 𝔅 $$\mathfrak{B}$$ can be realized as a relativization (to a reflexive equivalence element) of a simple relation algebra that it generates. We shall call such algebras simple closures of 𝔅 $$\mathfrak{B}$$ .

Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-67696-8_5

Ordering information: This item can be ordered from
http://www.springer.com/9783319676968

DOI: 10.1007/978-3-319-67696-8_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().