scholarly journals Lattices of pseudovarieties

Author(s):  
P. Agliano ◽  
J. B. Nation

AbstractWe consider the lattice of pseudovarieties contained in a given pseudovariety P. It is shown that if the lattice L of subpseudovarieties of P has finite height, then L is isomorphic to the lattice of subvarieties of a locally finite variety. Thus not every finite lattice is isomorphic to a lattice of subpseudovarieties. Moreover, the lattice of subpseudovarieties of P satisfies every positive universal sentence holding in all lattice of subvarieties of varieties V(A) ganarated by algebras A ε P.

1972 ◽  
Vol 6 (3) ◽  
pp. 357-378 ◽  
Author(s):  
R.M. Bryant ◽  
L.G. Kovács

The skeleton of a variety of groups is defined to be the intersection of the section closed classes of groups which generate . If m is an integer, m > 1, is the variety of all abelian groups of exponent dividing m, and , is any locally finite variety, it is shown that the skeleton of the product variety is the section closure of the class of finite monolithic groups in . In particular, S) generates . The elements of S are described more explicitly and as a consequence it is shown that S consists of all finite groups in if and only if m is a power of some prime p and the centre of the countably infinite relatively free group of , is a p–group.


10.29007/8fkc ◽  
2018 ◽  
Author(s):  
Alex Citkin

Grounding on defining relations of a finitely presentable subdirectly irreducible (s.i.) algebra in a variety with a ternary deductive term (TD), we define the characteristic identity of this algebra. For finite s.i. algebras the characteristic identity is equivalent to the identity obtained from Jankov formula. In contrast to Jankov formula, characteristic identity is relative to a variety and even in the varieties of Heyting algebras there are the characteristic identities not related to Jankov formula. Every subvariety of a given locally finite variety with a TD term admits an optimal axiomatization consisting of characteristic identities. There is an algorithm that reduces any finite system of axioms of such a variety to an optimal one. Each variety with a TD term can be axiomatized by characteristic identities of partial algebras, and in certain cases these identities are related to the canonical formulas.


1997 ◽  
Vol 07 (04) ◽  
pp. 511-540 ◽  
Author(s):  
Keith A. Kearnes ◽  
Ágnes Szendrei

We show that a locally finite variety which omits abelian types is self-rectangulating if and only if it has a compatible semilattice term operation. Such varieties must have type-set {5}. These varieties are residually small and, when they are finitely generated, they have definable principal congruences. We show that idempotent varieties with a compatible semilattice term operation have the congruence extension property.


1978 ◽  
Vol 26 (3) ◽  
pp. 368-382 ◽  
Author(s):  
Sheila Oates MacDonald ◽  
M. R. Vaughan-Lee

AbstractAn example is constructed of a locally finite variety of non-associative algebras which satisfies the maximal condition on subvarieties but not the minimal condition. Based on this, counterexamples to various conjectures concerning varieties generated by finite algebras are constructed. The possibility of finding a locally finite variety of algebras which satisfies the minimal condition on subvarieties but not the maximal is also investigated.


1995 ◽  
Vol 05 (06) ◽  
pp. 651-672 ◽  
Author(s):  
JOEL BERMAN

Chapter 12 of "The Structure of Finite Algebras" by D. Hobby and R. McKenzie contains theorems revealing how the set of types appearing in a locally finite variety [Formula: see text] influences the size of the free algebra in [Formula: see text] freely generated by n elements. We provide more results in this vein. If A is a subdirectly irreducible algebra of size k, then a lower bound on the number of n-ary polynomials of A is obtained for each case that the monolith of A has type 3, 4, or 5. Examples for every k show that in each case the lower bound is the best possible. As an application of these results we show that for every finite k if all k-element simple algebras are partitioned into five classes according to their type, then algebras in each class have a sharply determined band of possible values for their free spectra. These five bands are disjoint except for some overlap on simple algebras of types 2 and 5.


1972 ◽  
Vol 14 (3) ◽  
pp. 364-367 ◽  
Author(s):  
Roger M. Bryant

A group is called an s-group if it is locally finite and all its Sylow subgroups are abelian. Kovács [4] has shown that, for any positive integer e, the class se of all s-groups of exponent dividing e is a (locally finite) variety. The proof of this relies on the fact that, for any e, there are only finitely many (isomorphism classes of) non-abelian finite simple groups in se; and this is a consequence of deep results of Walter and others (see [6]). In [2], Christensen raised the finite basis question for the laws of the varieties se. It is easy to establish the finite basis property for an se which contains no non-abelian finite simple group; and Christensen gave a finite basis for the laws of the variety s30, whose only non-abelian finite simple group is PSL(2,5). Here we prove Theorem For any positive integer e, the varietysehas a finite basis for its laws.


2010 ◽  
Vol 75 (1) ◽  
pp. 103-130 ◽  
Author(s):  
Richard A. Shore ◽  
Bjørn Kjos-Hanssen

AbstractWe affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, . In fact, we prove that every sublattice of any hyperarithmetic lattice (and so, in particular, every countable, locally finite lattice) is isomorphic to an initial segment of . Corollaries include the decidability of the two quantifier theory of , and the undecidability of its three quantifier theory. The key tool in the proof is a new lattice representation theorem that provides a notion of forcing for which we can prove a version of the fusion lemma in the hyperarithmetic setting and so the preservation of ω1ck. Somewhat surprisingly, the set theoretic analog of this forcing does not preserve ω1. On the other hand, we construct countable lattices that are not isomorphic to any initial segment of .


1999 ◽  
Vol 51 (4) ◽  
pp. 792-815 ◽  
Author(s):  
G. Grätzer ◽  
F. Wehrung

AbstractIn general, the tensor product, A ⊗ B, of the lattices A and B with zero is not a lattice (it is only a join-semilattice with zero). If A ⊗ B is a capped tensor product, then A ⊗ B is a lattice (the converse is not known). In this paper, we investigate lattices A with zero enjoying the property that A ⊗ B is a capped tensor product, for every lattice B with zero; we shall call such lattices amenable.The first author introduced in 1966 the concept of a sharply transferable lattice. In 1972, H. Gaskill defined, similarly, sharply transferable semilattices, and characterized them by a very effective condition (T).We prove that a finite lattice A is amenable iff it is sharply transferable as a join-semilattice.For a general lattice A with zero, we obtain the result: A is amenable iff A is locally finite and every finite sublattice of A is transferable as a join-semilattice.This yields, for example, that a finite lattice A is amenable iff A ⊗ F(3) is a lattice iff A satisfies (T), with respect to join. In particular, M3 ⊗ F(3) is not a lattice. This solves a problem raised by R. W. Quackenbush in 1985 whether the tensor product of lattices with zero is always a lattice.


2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Denis Osin

Abstract A finitely generated group 𝐺 is said to be condensed if its isomorphism class in the space of finitely generated marked groups has no isolated points. We prove that every product variety U ⁢ V \mathcal{UV} , where 𝒰 (respectively, 𝒱) is a non-abelian (respectively, a non-locally finite) variety, contains a condensed group. In particular, there exist condensed groups of finite exponent. As an application, we obtain some results on the structure of the isomorphism and elementary equivalence relations on the set of finitely generated groups in U ⁢ V \mathcal{UV} .


Sign in / Sign up

Export Citation Format

Share Document