JOURNAL ARTICLE

Varieties of implicative semi-lattices. II

William C. NemitzThomas Whaley

Year: 1973 Journal:   Pacific Journal of Mathematics Vol: 45 (1)Pages: 303-311   Publisher: Mathematical Sciences Publishers

Abstract

This paper is concerned with a process of coordinatization of the lattice of varieties of implicative semilattices.Equational descriptions of some elements in each coordinate class, and a complete equational description of one coordinate class are given.1* Introduction* This paper is a continuation of [8] Familiarity with [8] and [6] is assumed.After stating some of the consequences of the local ίiniteness of the variety of implicative semilattices, we describe a system for partitioning the lattice of varieties of implicative semi-lattices into coordinate intervals, and give some results that can be obtained from a study of this coordinatization.Finally, we give equational descriptions for the largest and smallest varieties in each coordinate class, the covers of the smallest variety in each coordinate class and a complete equational description of the coordinate class 4,2.Recall that an implicative semi-lattice is subdirectly irreducible if and only if it has a single dual atom.In accordance with the usage of [8], this dual atom will be denoted by u.If in a subdirectly irreducible implicative semi-lattice, the dual atom is deleted, the remaining structure is both a subalgebra and a homomorphic image of the original.Thus every subdirectly irreducible implicative semi-lattice may be thought of as obtained by appending a single dual atom to some already given implicative semi-lattice.If L is an implicative semilattice, the subdirectly irreducible implicative semilattice obtained in this manner will be denoted by L.2* Local finiteness* The following theorem was proven first by A. Diego [2] in a slightly different context.McKay [4] extended the result to implicative semi-lattices.We present a much simpler proof here.THEOREM 2.1.The variety of implicative semi-lattices is locally finite.Proof.Let F n denote the free implicative semi-lattice on n generators.The proof proceeds by induction.F x has two elements.Assume that F n is finite.F n+I ^sγ [ L if where each L* is n + 1 generated.Hence each Li is n generated.It follows from the induction assumption that there are only a finite number of distinct L { each 303 COROLLARY 3.2.V n , m contains only a finite number of distinct finite subdirectly irreducible algebras.

Keywords:
Mathematics Pure mathematics

Metrics

42
Cited By
17.11
FWCI (Field Weighted Citation Impact)
41
Refs
0.99
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Advanced Algebra and Logic
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
linguistics and terminology studies
Social Sciences →  Arts and Humanities →  Language and Linguistics
Rough Sets and Fuzzy Logic
Physical Sciences →  Computer Science →  Computational Theory and Mathematics

Related Documents

JOURNAL ARTICLE

Implicative Semi-Lattices

William C. Nemitz

Journal:   Transactions of the American Mathematical Society Year: 1965 Vol: 117 Pages: 128-128
JOURNAL ARTICLE

Implicative semi-lattices

William C. Nemitz

Journal:   Transactions of the American Mathematical Society Year: 1965 Vol: 117 (0)Pages: 128-142
BOOK-CHAPTER

Implicative Quasi-Semi-Lattices

Xiaolei ZhuWenjuan Chen

Frontiers in artificial intelligence and applications Year: 2022
JOURNAL ARTICLE

Relatively free implicative semi-lattices

W. J. LandoltTom Whaley

Journal:   Algebra Universalis Year: 1974 Vol: 4 (1)Pages: 166-184
JOURNAL ARTICLE

Density and closure in implicative semi-lattices

Jerome F. EasthamWilliam C. Nemitz

Journal:   Algebra Universalis Year: 1975 Vol: 5 (1)Pages: 1-7
© 2026 ScienceGate Book Chapters — All rights reserved.