Course: Universal Algebra for Computer Scientists

» List of faculties » PRF » KAG
Course title Universal Algebra for Computer Scientists
Course code KAG/PGSUI
Organizational form of instruction Lecture
Level of course Doctoral
Year of study not specified
Semester Winter and summer
Number of ECTS credits 12
Language of instruction Czech, English
Status of course unspecified
Form of instruction Face-to-face
Work placements This is not an internship
Recommended optional programme components None
Lecturer(s)
  • Chajda Ivan, prof. RNDr. DrSc.
Course content
The course introduces general algebraic constructions and main results of universal algebra. The introduction is devoted to algebras and basic algebraic constructions: subalgebras, morphisms, products, subdirect representations, etc. Further parts of the course introduce classes of algebras definable by identities and quasiidentities and their characterization as classes of algebras closed under certain class operators (Birkhoff's variety theorem, characterization of quasivarieties). The final part of the course is aimed as selected topics from universal algebra: selected properties of varieties, primality, and functional completeness. 1. Algebras, subalgebras, and morphisms

Learning activities and teaching methods
Lecture
Learning outcomes
To introduce the general algebraic constructions and main results of universal algebra to students.
1. Knowledge Advanced theory of universal algebras is presented. Varieties of algebras are treated. Congruence conditions are classified by mens of free algebras.
Prerequisites
unspecified

Assessment methods and criteria
Oral exam, Written exam

Knowledge of the basic construction (subalgebras, homomorphic images, quotient algebras, direct and subdirect products). Homomorphism and isomorphism theorems. Subdirectly irreducible algebras. Free algebras, terms, induction over the term complexity. Varieties of algebras. Birkhoff theorems. Equacional logic. Congruence conditions..
Recommended literature
  • Burris S., Sankappanavar H. P. (1981). A Course in Universal Algebra. Springer-Verlag, New York.
  • Denecke K., Wismath S. L. (2001). Universal Algebra and Applications in Computer. Chapman & Hall/CRC.
  • Gratzer G. (1979). Universal Algebra. Springer-Verlag Berlin Heidelberg (druhé vydání).
  • Chajda I., Glazek K. (2002). A Basic Course on General Algebra. Technical University Press, Zielona Góra.
  • Ježek J. (1976). Univerzální algebra a teorie modelů. SNTL Praha.
  • Michael J. O'Donnell. (1985). Equational Logic as a Programming Language. MIT Press.
  • Wechler W. (1992). Universal Algebra for Computer Scientists. Springer-Verlag Berlin Heidelberg.


Study plans that include the course
Faculty Study plan (Version) Category of Branch/Specialization Recommended year of study Recommended semester