[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Dedekind–MacNeille Completion of n-ordered Sets

  • Published:
Order Aims and scope Submit manuscript

Abstract

A completion of an n-ordered set \({\mathbf{P}}{\text{ = }}{\left\langle {P, \lesssim _{1} , \ldots , \lesssim _{n} } \right\rangle }\) is defined, by analogy with the case of posets (2-ordered sets), as a pair \({\left\langle {e,{\mathbf{Q}}} \right\rangle }\), where Q is a complete n-lattice and \(e{\text{:}}{\mathbf{P}} \to {\mathbf{Q}}\) is an n-order embedding. The Basic Theorem of Polyadic Concept Analysis is exploited to construct a completion of an arbitrary n-ordered set. The completion reduces to the Dedekind–MacNeille completion in the dyadic case, the case of posets. A characterization theorem is provided, analogous to the well-known dyadic one, for the case of joined n-ordered sets. The condition of joinedness is trivial in the dyadic case and, therefore, this characterization theorem generalizes the uniqueness theorem for the Dedekind–MacNeille completion of an arbitrary poset.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.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

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Biedermann, K.: An equational theory for trilattices. Algebra Univers. 42, 253–268 (1999)

    Article  MATH  Google Scholar 

  2. Birkhoff, G.: Lattice Theory, 3rd edn. American Mathematical Society, Providence, RI (1973)

    Google Scholar 

  3. Davey, B. A., Priestley, H. A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  5. Koppelberg, S.: Handbook of Boolean Algebras, vol. 1. North-Holland, Amsterdam (1989)

    Google Scholar 

  6. MacNeille, H. M.: Partially ordered sets. Trans. Am. Math. Soc. 42, 416–460 (1937)

    Article  MATH  Google Scholar 

  7. Voutsadakis, G.: Polyadic concept analysis. Order 19, 295–304 (2002)

    Article  MATH  Google Scholar 

  8. Voutsadakis, G.: An equational theory of n-lattices. Submitted to Algebra Universalis. Preprint available at http://www.voutsadakis.com/RESEARCH/papers.html

  9. Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.), Ordered Sets, pp. 445–470. Reidel, Dordrecht (1982)

    Google Scholar 

  10. Wille, R.: Concept lattices and conceptual knowledge systems. Comput. Math. Appl. 23, 493–515 (1992)

    Article  MATH  Google Scholar 

  11. Wille, R.: The basic theorem of triadic concept analysis. Order 12, 149–158 (1995)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Computer Science, Lake Superior State University, 650 W. Easterday Avenue, Sault Sainte Marie, MI, 49783, USA

    George Voutsadakis

Authors
  1. George Voutsadakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to George Voutsadakis.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Voutsadakis, G. Dedekind–MacNeille Completion of n-ordered Sets. Order 24, 15–29 (2007). https://doi.org/10.1007/s11083-007-9055-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-007-9055-3

Keywords

Mathematics Subject Classifications (2000)

Search

Navigation