Modern Algebra

  • David Gries
  • Fred B. Schneider
Chapter
Part of the Texts and Monographs in Computer Science book series (MCS)

Abstract

Modern algebra is the study of the structure of certain sets along with operations on them. An algebra is basically a model of a theory, as discussed near the beginning of Chap. 9. The algebras discussed here are semigroups, monoids, groups, and boolean algebras. They are useful throughout computer science and mathematics. For example, Chap. 8 was devoted to the study of quantification over an arbitrary abelian monoid. Semigroups and monoids find application in formal languages, automata theory, and coding theory. And, one boolean algebra is the standard model of the propositional calculus. Important in our study is not only the various algebras but their interrelationship. Thus, we study topics like isomorphisms, homomorphisms, and automorphisms of algebras. (Historical note 18.1 discusses the origin of these words.)

Keywords

Boolean Algebra Additive Group Binary Operator Propositional Calculus Prove Theorem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1993

Authors and Affiliations

  • David Gries
    • 1
  • Fred B. Schneider
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations