Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 3 of 3 for “"finitely based"”.
-
On the Finite Axiomatizability of Equational Theories of Automatic Algebras
… set of equations, for which we call the algebra finitely based. If not, we can further ask if the algebra satisfies a stronger condition we call inherently nonfinitely based. For instance all finite groups and rings were shown in 1964 and 1973, respectively, to be finitely based.</p><p>A finite …
-
Varieties of lattices
… basis theorem and some results about the join of finitely based lattice varieties. Included in the last chapter is a characterisation of the amalgamation classes of certain congruence distributive varieties and the result that there are only three lattice varieties which have the amalgamation …
-
Ramsey Algebras and Ramsey Spaces
Hindman's theorem says that every finite coloring of the natural numbers has a monochromatic set of finite sums. Galvin and Glazer gave a brilliant simple proof of Hindman's theorem using idempotent ultrafilters. We study Ramsey algebras, which are structures that satisfy an analogue of Hindman's …