English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Using a method of R. McKenzie, we construct a finitely generated semisimple variety of infinite type, and a finitely generated nonsemisimple variety of finite type, both having arbitrarily large finite but no infinite simple members. This amplifies M. Valeriote's negative solution to Problem 11 from Hobby and McKenzie, The Structure of Finite Algebras. R. McKenzie [2] has constructed a finitely generated variety having arbitrarily large finite, but no infinite, subdirectly irreducible members; and a second finitely generated variety, this time of finite type, having a unique countably infinite subdirectly irreducible member but no uncountable subdirectly irreducible members. M. Valeriote [4] has subsequently shown that McKenzie's second example can be modified to make the variety semisimple, i.e., so that every subdirectly irreducible member is simple. (In Valeriote's example there are three, rather than one, countably infinite simple members.) In this note we (1) show that McKenzie's first example can also be modified to make the variety semisimple; (2) modify McKenzie's second example in a different way to obtain a finitely generated (nonsemisimple) variety of finite type having arbitrarily large finite, but no infinite, simple members. 1. MCKENZIE'S METHOD The following is a summary of a method invented by McKenzie in [2, ?6], as it is described in [5]. An M-algebra is any algebra A whose type includes A (binary) and 0 (nullary) but no other nullary operation symbols, and which satisfies 1. The reduct (A, A) is a height-i meet semilattice with least element 0; 2. 0 is an absorbing element for each fundamental operation F of A; that is, if F is n-ary then 0 E {ai,,aI} C A implies F(al,..,an) = 0. Suppose A is an M-algebra and U = A \ {0}. Consider an arbitrary subpower B ? by f > g if and only if FB(h1,... ,hn) = g for some fundamental operation symbol F and some hi E B(U) such that f E {hi, ..., hn}. Also let >> Received by the editors October 26, 1995. 1991 Mathematics Subject Classification. Primary 08B26.

Two finitely generated varieties having no infinite simple members