Hostname: page-component-78c5997874-ndw9j Total loading time: 0 Render date: 2024-11-09T12:38:57.670Z Has data issue: false hasContentIssue false
  • English
  • Français

A completion-invariant extension of the concept of meet continuous lattices

Published online by Cambridge University Press:  15 May 2015

WENFENG ZHANG  and
XIAOQUAN XU
WENFENG ZHANG
Affiliation:
School of Mathematics and Computer Science, Jiangxi Science & Technology Normal University, Nanchang 330038, China Email: [email protected]
XIAOQUAN XU
Affiliation:
Department of Mathematics, Jiangxi Normal University, Nanchang 330022, China Email: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper, the concept of meet F-continuous posets is introduced. The main results are: (1) A poset P is meet F-continuous iff its normal completion is a meet continuous lattice iff a certain system γ(P) which is, in the case of complete lattices, the lattice of all Scott closed sets is a complete Heyting algebra; (2) A poset P is precontinuous iff P is meet F-continuous and quasiprecontinuous; (3) The category of meet continuous lattices with complete homomorphisms is a full reflective subcategory of the category of meet F-continuous posets with cut-stable maps.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 27 , Special Issue 4: Symposium on Domain Theory (ISDT 2013) , May 2017 , pp. 530 - 539
Copyright
Copyright © Cambridge University Press 2015 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Crawley, P. and Dilworth, R.P. (1973). Algebraic Theory of Lattices, Prentice-Hall, Inc., Englewood Cliffs, N.J. Google Scholar
Dedekind, R. (1872). Stetigkeit und irrationale Zahlen. Vieweg, Braunschweig.Google Scholar
Erné, M. (1981). A completion-invariant extension of the concept of continuous lattices. In: Banaschewski, B. and Hoffmann, R.-E. (eds.) Continuous Lattices, Proc. Bremen 1979. Lecture Notes in Mathematic 871, Springer-Verlag, Berhn-Heidelberg-New York 43–60.Google Scholar
Erné, M. (1991). The Dedekind–MacNeille completion as a reflector. Order 8 159–173.Google Scholar
Erné, M. (1993). Distributive laws for concept lattices. Algebra Universalis 30 538–580.Google Scholar
Frink, O. (1954). Ideals in partially ordered sets. American Mathematical Monthly 61 223–234.Google Scholar
Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M. and Scott, D.S. (2003). Continuous lattices and domains. Encyclopedia of Mathematics and its Applications, volume 93, Cambridge University Press.Google Scholar
Gierz, G. and Lawson, J.D. (1981). Generalized continuous lattices and hypercontinuous lattices. Rocky Mountain Journal 11 271–296.Google Scholar
Herrlich, H. and Strecker, G. (1979). Category Theory, Heldermann Verlag, Berlin.Google Scholar
Harding, J. and Bezhanishvili, G. (2004). Macneille completions of Heyting algebras. Houston Journal of Mathematics 30 937–952.Google Scholar
Kou, H., Liu, Y.M. and Luo, M.K. (2003). On meet-continuous dcpos. In: Zhang, G., Lawson, J.D., Liu, Y. and Luo, M. (eds.) Domain Theory, Logic and Computation, Kluwer Academic Publishers 137–149.Google Scholar
MacNeille, H.M. (1937). Partially ordered sets. Transactions of the American Mathematical Society 42 416–460.CrossRefGoogle Scholar
Niederle, J. (2005). On infinitely distributive ordered sets. Mathematica Slovaca 55 495–502.Google Scholar
Venugopalan, P. (1990). A generalization of completely distributive lattices. Algebra Universalis 27 578–586.Google Scholar
Xu, X.Q. and Yang, J.B. (2009). Topological representations of distributive hypercontinuous lattices. Chinese Annals of Mathematics 30 199–206.Google Scholar
Yang, J.B. and Xu, X.Q. (2010). The dual of a generalized completely distributive lattice is a hypercontinuous lattice. Algebra Universalis 63 275–281.Google Scholar
Zhang, W.F. and Xu, X.Q. (2014). Meet precontinuous posets. In: Zhang, G., Mislove, M., Luo, M. (eds.) Proeedings of the 6th International Symposium on Domain Theory and its Applications Electronic Notes in Theoretical Computer Science 301 179–188.Google Scholar