On sets of first-order formulas axiomatizing representable relation algebras
classification
🧮 math.LO
math.RA
keywords
algebrasrelationvarietyauthoraxiomatizingbackgroundbasisbirkoff
read the original abstract
This is the author's 2004 Master's thesis at Iowa State University, done under the supervision of Roger D. Maddux. It provides a background in relation algebras. Three results from the literature are demonstrated in full: (i.) RRA is a variety. (ii.) RRA is not finitely based. (iii.) Any equational basis for RRA has infinitely many variables. We also give an elementary proof of Birkoff's variety theorem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.