One-step closure, weak one-step closure and meet continuity
Electronic Notes in Theoretical Informatics and Computer Science · 2023
DOI: 10.46298/entics.10352 ↗Kurz gefasst
Fachartikel in der Zeitschrift Electronic Notes in Theoretical Informatics and Computer Science, 2023. Verfasst von Hualin Miao und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).
Abstract (Originalsprache)
This paper studies the weak one-step closure and one-step closure properties concerning the structure of Scott closures. We deduce that every quasicontinuous domain has weak one-step closure and show that a quasicontinuous poset need not have weak one-step closure. We also constructed a non-continuous poset with one-step closure, which gives a negative answer to an open problem posed by Zou et al.. Finally, we investigate the relationship between weak one-step closure property and one-step closure property and prove that a poset has one-step closure if and only if it is meet continuous and has weak one-step closure.
Zitieren
APA
Miao, H., Li, Q., & Zhao, D. (2023). One-step closure, weak one-step closure and meet continuity. Electronic Notes in Theoretical Informatics and Computer Science. https://doi.org/10.46298/entics.10352
Vancouver
Miao H, Li Q, Zhao D. One-step closure, weak one-step closure and meet continuity. Electronic Notes in Theoretical Informatics and Computer Science. 2023. doi:10.46298/entics.10352
BibTeX
@article{Miao2023,
author = {Miao, Hualin and Li, Qingguo and Zhao, Dongsheng},
title = {One-step closure, weak one-step closure and meet continuity},
journal = {Electronic Notes in Theoretical Informatics and Computer Science},
year = {2023},
doi = {10.46298/entics.10352}
}
EUVIMED