Sublattices of lattices of order-convex sets, III. The case of totally ordered sets

Details Sublattices of lattices of order-convex sets, III. The case of totally ordered sets Sublattices of lattices of order-convex sets, III. The case of totally ordered sets

2005-01-21

arxiv.org/abs/math/0501339v1

International Journal of Algebra and Computation 14, no. 3 (2004) 357-387

Mathematics

General Mathematics

Scientific paper

For a partially ordered set P, let Co(P) denote the lattice of all order-convex subsets of P. For a positive integer n, we denote by SUB(LO) (resp., SUB(n)) the class of all lattices that can be embedded into a product of lattices of convex subsets of chains (resp., chains with at most n elements). We prove the following results: (1) Both classes SUB(LO) and SUB(n), for any positive integer n, are locally finite, finitely based varieties of lattices, and we find finite equational bases of these varieties. (2) The variety SUB(LO) is the quasivariety join of all the varieties SUB(n), for 1 ≤ n < \omega, and it has only countably many subvarieties. We classify these varieties, together with all the finite subdirectly irreducible members of SUB(LO). (3) Every finite subdirectly irreducible member of SUB(LO) is projective within SUB(LO), and every subquasivariety of SUB(LO) is a variety.

Affiliated with

Also associated with

No associations

Rating

Sublattices of lattices of order-convex sets, III. The case of totally ordered sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sublattices of lattices of order-convex sets, III. The case of totally ordered sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sublattices of lattices of order-convex sets, III. The case of totally ordered sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-593860