Directed Completions and DM-Completions on \(\mathcal {R}-\)Posets

  • Li-gang Wu
  • Lei Fan
Part of the Advances in Soft Computing book series (AINSC, volume 54)


As an enrichment of single order the notion of \(\mathcal{R}\)-posets have been introduced by Ji Wen in [8]. Let \((P,\sqsubseteq)\) be a poset and ω the natural number set whose order is denoted by ≤. If \(\mathcal {R}=(\sqsubseteq_n)_{n\in\omega}\) is a family of partial orders on P such that (i)∀ n,m ∈ ω,m ≤ n implies \(\sqsubseteq_n \subseteq \sqsubseteq_m\), and (ii)\({\bigcap}_{n\in\omega}\sqsubseteq_n=\sqsubseteq\), then call \((P,\sqsubseteq)\) a poset with partial order family \(\mathcal {R}\)(\(\mathcal {R}\)-poset for short),denoted by \((P,\sqsubseteq;\mathcal {R})\). It provides possibility to interpret or measure the complex information in stepwise computing. We will write simply \(P_n=(P,\sqsubseteq_n)\) and \(P=(P,\sqsubseteq)\) respectively if no confusion can rise.

Let \(\mathcal {C}(P_n)\) be some completion of P n .It is of interest to know the connections between \(\mathcal {C}(P_n)\) and \(\mathcal {C}(P_{n+1})\) or between \(\mathcal {C}(P_n)\) and \(\mathcal {C}(P)\). Let \(\mathcal {O}(P)(\mathcal {O}(P_n))\) and \(\mathcal {I}(P)(\mathcal {I}(P_n))\) denote all lower sets and all ideals of P(P n ) respectively.It concludes that \(\mathcal {O}(P_n)\subseteq\mathcal {O}(P_{n+1})\subseteq \mathcal {O}(P)\) for all n ∈ ω which implies that \(\bigcup_{n \in\omega}\mathcal {O}(P_n)\subseteq\mathcal {O}(P) \).But if we require that \(\mathcal {I}(P_n)\subseteq\mathcal {I}(P_{n+1})\subseteq \mathcal {I}(P)\) and =  n  is  =  P   for all n ∈ ω then \(\sqsubseteq_n=\sqsubseteq\) for all n ∈ ω. The Dedekind-MacNeile completions(DM-completion for brevity) are also investigated.It is concluded that \(\sqsubseteq_n=\sqsubseteq\) for all n ∈ ω if \(\sqsubseteq_{n+1}\) is a close subrelation of \(\sqsubseteq_n\) for all n ∈ ω. The Glois connections can be well preserved on every order in \(\mathcal {R}-\)poset.

It is worth pointing out that several interesting examples are indicated to make the study more intelligible.It is our future work to apply domain theory to the formal concept analysis,where it will be possible to approximate infinite informations by finite or computable ones.


\(\mathcal {R}-\)poset directed completion Dedekind-MacNeille completion formal concept 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Monteiro, L.: Semantic Domains Based on Sets with Families of Equivalences. Electronic Notes in Theoretical Computer Science 11, 1–34 (1998)CrossRefGoogle Scholar
  2. 2.
    Hansen, V.S., Lindström, I., Griffor, E.R.: Mathematical Theory of Domains. Cambridge University Press, Cambridge (1994)zbMATHGoogle Scholar
  3. 3.
    Abramsky, S., Jung, A.: Domain Theory [M]. In: Abramsky, S., Gabay, D., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 3, pp. 1–168. Oxford University Press, Oxford (1995)Google Scholar
  4. 4.
    Michael, W.: Mislove: Topology, Domain theory and theoretical computer science. Topology and its Applications 89(1-2), 3–59 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Davey, B.A., Priestley, H.A.: Introduction To Lattices and Order. Cambridge Press, Cambridge (2002)zbMATHGoogle Scholar
  6. 6.
    Munkres, J.R.: Topology, 2nd edn. Pearson Education Asia Limited and China Machine Press (2004)Google Scholar
  7. 7.
    Ganter, B., Wille, R.: Formal Concept Analysis. In: Mathematical Foundations. Springer, New York (1999)Google Scholar
  8. 8.
    Wen, J.: The Information Order Approximation and Generalized Chains’Completion. Capital Normal University, Master Paper, Beijing (2005) (in Chinese)Google Scholar
  9. 9.
    Chongyou, Z., Lei, F., Hongbin, C.: Frame and Continuous Lattices, 2nd edn. Capital Normal University Press, Beijing (2000) (in Chinese)Google Scholar
  10. 10.
    Ligang, W., Lei, F.: The Comparision of Scott Topology on Posets with Families of Partial Order. Journal of Capital Normal University(Natural Science Edition) 28, 14–16 (2007) (in Chinese)zbMATHGoogle Scholar
  11. 11.
    Ligang, W., Lei, F.: Cpo,Algebraic cpo and Continuous cpo on \(\mathcal{R}\)-posets. Journal of Mathematics (accepted) (in Chinese)Google Scholar
  12. 12.
    Junhua, X.: Ordered Observation Systems. Capital Normal University,Master Paper, Beijing (2007) (in Chinese)Google Scholar
  13. 13.
    Theunissen, M., Venema, Y.: MacNeille completions of lattice expansions. Algebra Universalis 57(2), 143–193 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Kwuida, L., Seselja, B., Tepavčević, A.: On the MacNeille Completion of Weakly Dicomplemented Lattices. In: Kuznetsov, S.O., Schmidt, S. (eds.) ICFCA 2007. LNCS (LNAI), vol. 4390, pp. 271–280. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  15. 15.
    Erné, M.: The Dedekind-MacNeille completion as a reflector. Order 8(2), 159–173 (1991)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Li-gang Wu
    • 1
  • Lei Fan
    • 2
  1. 1.Academy of Mathematics and Interdisciplinary Science School of Mathematics ScienceCapital Normal UniversityBeijingP.R. China
  2. 2.Department of Educational TechnologyCapital Normal UniversityBeijingP.R. China

Personalised recommendations