IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-94-017-3267-3_7.html

Universal Algebra

In: The Concise Handbook of Algebra

Author

Listed:
  • Vyacheslav A. Artamonov
  • Günter F. Pilz
  • Boris I. Plotkin
  • Kalle Kaarli
  • Lev N. Shevrin
  • Evgeny V. Sukhanov
  • Mikhail V. Volkov
  • A. G. Pinus
  • Yefim Katsov
  • Leonid Bokut’
  • Hajnal Andréka
  • Judit X. Madarász
  • István Németi
  • Peter Burmeister
  • Hans-Dieter Ehrich

Abstract

An n -ary operation (n ∈ ℕ0) on a set A is a map ω: A n → A, where A 0 := { ∅ }. The number n is called the arity of ω. A universal algebra is a pair 𝒜 = (A, Ω) consisting of a non-empty set A and a set Ω of operations on A. The set A and the members of Ω are called the universe and the fundamental operations of the algebra 𝒜, respectively. In practice, one usually is not interested in a single, isolated algebra but in a class of algebras of the same type. Therefore it is more customary to consider the set Ω not as the set of operations on the given set A but rather as the set of operation symbols. Formally this is achieved by first introducing the notion of type. The type is a set Ω together with a partition Ω = Ω0 ∪ Ω1 ∪ Ω2⋯. (Empty Ω i are allowed.) Alternatively, the type is a set Ω together with a mapping r: Ω → ℕ0. A universal algebra of type Ω, or simply an Ω-algebra is a pair 𝒜 = (A, Ω) where A is a non-empty set and to every ω ∈ Ω n it is assigned an n-ary operation on A, denoted by the same symbol ω. Cf. Section G.10 for a generalization of these concepts.

Suggested Citation

  • Vyacheslav A. Artamonov & Günter F. Pilz & Boris I. Plotkin & Kalle Kaarli & Lev N. Shevrin & Evgeny V. Sukhanov & Mikhail V. Volkov & A. G. Pinus & Yefim Katsov & Leonid Bokut’ & Hajnal Andréka & Jud, 2002. "Universal Algebra," Springer Books, in: The Concise Handbook of Algebra, chapter 0, pages 451-490, Springer.
  • Handle: RePEc:spr:sprchp:978-94-017-3267-3_7
    DOI: 10.1007/978-94-017-3267-3_7
    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

    Keywords

    ;
    ;
    ;
    ;
    ;

    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-94-017-3267-3_7. 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.