Skip to main content
SpringerLink
Log in
Book cover

International Conference on Formal Concept Analysis

ICFCA 2005: Formal Concept Analysis pp 408–416Cite as

Which Concept Lattices Are Pseudocomplemented?

  • Conference paper

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

Abstract

We give a contextual characterization of pseudocomplementation by means of the arrow relations.

AMS Subject Classification: 06D15

Keywords

  • lattices
  • pseudocomplement
  • closure operator
  • Formal Concept Analysis
  • arrow-relation
  • complete homomorphism

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balbes, R., Dwinger, P.: Distributive lattices. University of Missouri Press (1974)

    Google Scholar 

  2. Chajda, I., Glazek, K.: A basic course on general algebra. Technical University Press, Zielona Góra (2000)

    Google Scholar 

  3. Chameni Nembua, C., Monjardet, B.: Finite pseudocomplemented lattices and “permutoedre”. Discrete Math. 111(1-3), 105–112 (1993)

    CrossRef  MATH  MathSciNet  Google Scholar 

  4. Ganter, B., Wille, R.: Formal Concept Analysis – Mathematical Foundations. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  5. Grätzer, G.: Lattice Theory. First concepts and distributive lattices. W.H. Freeman and Company, New York (1971)

    MATH  Google Scholar 

  6. Katrinak, T.: P-algebras. Contributions to lattice theory, Szeged/Hung (1980), Colloq. Math. Soc. Janos Bolyai 33, 549–573 (1983)

    Google Scholar 

  7. Kwuida, L.: Dicomplemented lattices. A contextual generalization of Boolean algebras. Dissertation, TU Dresden (2004)

    Google Scholar 

  8. Lee, K.B.: Equational classes of distributive pseudo-complemented lattices. Can. J. Math. 22, 881–891 (1970)

    CrossRef  MATH  Google Scholar 

  9. Schmid, J.: Lee classes and sentences for pseudo-complemented semilattices. Algebra Univers. 25(2), 223–232 (1988)

    CrossRef  MATH  Google Scholar 

  10. Sofronie-Stokkermans, V.: Representation theorems and automated theorem proving in certain classes of non-classical logics. In: Proceedings of the ECAI 1998, workshop on many-valued Logic for AI applications (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Algebra, TU Dresden, D-01062, Dresden, Germany

    Bernhard Ganter & Léonard Kwuida

Authors
  1. Bernhard Ganter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Léonard Kwuida
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Algebra, University of Technology, Dresden, Germany

    Bernhard Ganter

  2. Département d’informatique, UQAM, P.O. Box, Montréal, (Qc), Canada

    Robert Godin

Rights and permissions

Reprints and Permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ganter, B., Kwuida, L. (2005). Which Concept Lattices Are Pseudocomplemented?. In: Ganter, B., Godin, R. (eds) Formal Concept Analysis. ICFCA 2005. Lecture Notes in Computer Science(), vol 3403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32262-7_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-32262-7_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24525-4

  • Online ISBN: 978-3-540-32262-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

search

Navigation