Show simple item record

dc.contributor.advisorPowell, Wayne B.
dc.contributor.authorMcClurkan, Michael B.
dc.date.accessioned2015-09-08T18:12:36Z
dc.date.available2015-09-08T18:12:36Z
dc.date.issued1985-12-01
dc.identifier.urihttps://hdl.handle.net/11244/17370
dc.description.abstractA method for the construction of free lattice-ordered algebras was developed in the setting of a variety of abstract algebras in which subdirectly irreducible algebras are totally ordered. The method developed simplified the problem of construction of free t-algebras in that the free unordered algebra, which is in general easier to find, is used. Various examples of varieties of algebras for which this method of construction is valid were presented and noted as the motivating factors for this paper. One particular construction, that of a Boolean algebra, led me to be able to characterize the cardinality of finite free Boolean algebras. This characterization in turn led to a result that described the order of a free t-algebra in a somewhat more general setting.
dc.formatapplication/pdf
dc.languageen_US
dc.publisherOklahoma State University
dc.rightsCopyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material.
dc.titleGeneral Method for the Construction of Free Lattice-ordered Algebras
dc.typetext
dc.contributor.committeeMemberDuwall, Paul
dc.contributor.committeeMemberHaack, Joel K.
osu.filenameThesis-1985-M128g.pdf
osu.accesstypeOpen Access
dc.description.departmentMathematics
dc.type.genreThesis


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record