Not every countable complete distributive lattice is sober

DOI10.1017/s0960129523000269arXiv2205.00250MaRDI QIDQ6149954

Dongsheng Zhao, Hualin Miao, Xiaoyong Xi, Qing-Guo Li

Publication date: 5 March 2024

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.00250

zbMATH Keywords

complete latticesScott topologysobrietycountability

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• A note on coherence of dcpos
• Continuous Lattices and Domains
• Non-Hausdorff Topology and Domain Theory
• Prime Ideal Structure in Commutative Rings
• Unnamed Item
• Unnamed Item

This page was built for publication: Not every countable complete distributive lattice is sober