Skip to main content
Log in

Interval Dismantlable Lattices

  • Published:
Order Aims and scope Submit manuscript

Abstract

A finite lattice is interval dismantlable if it can be partitioned into an ideal and a filter, each of which can be partitioned into an ideal and a filter, etc., until you reach 1-element lattices. In this note, we find a quasi-equational basis for the pseudoquasivariety of interval dismantlable lattices, and show that there are infinitely many minimal interval non-dismantlable lattices.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ajtai, M.: On a class of finite lattices. Period. Math. Hungar. 4, 217–220 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ash, C.J.: Pseudovarieties, generalized varieties and similarly described classes. J. Algebra 92, 104–115 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  3. Gorbunov, V.A.: Algebraic Theory of Quasivarieties. Plenum, New York (1998)

    MATH  Google Scholar 

  4. Kelly, D., Rival, I.: Crowns, fences and dismantlable lattices. Canad. J. Math. 26, 1257–1271 (1974)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to J. B. Nation.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Adaricheva, K., Hyndman, J., Lempp, S. et al. Interval Dismantlable Lattices. Order 35, 133–137 (2018). https://doi.org/10.1007/s11083-017-9422-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-017-9422-7

Keywords

Navigation