IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-67696-8_5.html
   My bibliography  Save this book chapter

Simple Closures

In: Simple Relation Algebras

Author

Listed:
  • Steven Givant

    (Mills College, Department of Mathematics)

  • Hajnal AndrΓ©ka

    (AlfrΓ©d RΓ©nyi Institute of Mathematics, Institute of Mathematics, Hungarian Academy of Sciences)

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}$$ .

Suggested Citation

  • Steven Givant & Hajnal AndrΓ©ka, 2017. "Simple Closures," Springer Books, in: Simple Relation Algebras, chapter 0, pages 133-188, Springer.
  • Handle: RePEc:spr:sprchp:978-3-319-67696-8_5
    DOI: 10.1007/978-3-319-67696-8_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-319-67696-8_5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.