Nothing Special   »   [go: up one dir, main page]

Skip to main content

Algebraicity and the Tensor Product of Concept Lattices

  • Conference paper
Formal Concept Analysis (ICFCA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8478))

Included in the following conference series:

Abstract

In this paper we prove that the tensor product of complete lattices, as it is defined in formal concept analysis, preserves algebraicity. The proof of this fact is based on the compactness of propositional logic. We use this property to show that the box product of (0, ∨ )-semilattices, introduced by G.Grätzer and F.Wehrung in 1999, can be obtained from the tensor product of concept lattices in a manner similar to how it is done in the definition of tensor product in “general” lattice theory.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Chang, C.C., Keisler, H.J.: Model Theory, 3rd edn. North-Holland, Amsterdam (1990)

    MATH  Google Scholar 

  2. Ganter, B., Wille, R.: Formal concept analysis - mathematical foundations. Springer (1999)

    Google Scholar 

  3. Ganter, B., Wille, R.: Applied lattice theory: formal concept analysis, Appendix H in [7], pp. 591–605

    Google Scholar 

  4. Grätzer, G., Wehrung, F.: A survey of tensor products and related constructions in two lectures. Algebra Universalis 45, 117–134 (2001)

    MATH  MathSciNet  Google Scholar 

  5. Grätzer, G., Wehrung, F.: A new lattice construction: the box product. J. Algebra 221, 315–344 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  6. Grätzer, G., Wehrung, F.: Tensor products and transferability of semilattices. Canad. J. Math. 51, 792–815 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Grätzer, G.: General Lattice Theory, 2nd edn. Birkhäuser, Basel (1998)

    MATH  Google Scholar 

  8. Krötzsch, M., Malik, G.: The Tensor Product as a Lattice of Regular Galois Connections. In: Missaoui, R., Schmidt, J. (eds.) Formal Concept Analysis. LNCS (LNAI), vol. 3874, pp. 89–104. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Wille, R.: Tensorial decompositions of concept lattices. Order 2, 81–95 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  10. Wille, R.: Tensor products of complete lattices as closure systems. Contributions to General Algebra 7, 381–386 (1991)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Chornomaz, B. (2014). Algebraicity and the Tensor Product of Concept Lattices. In: Glodeanu, C.V., Kaytoue, M., Sacarea, C. (eds) Formal Concept Analysis. ICFCA 2014. Lecture Notes in Computer Science(), vol 8478. Springer, Cham. https://doi.org/10.1007/978-3-319-07248-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07248-7_5

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07247-0

  • Online ISBN: 978-3-319-07248-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics