arXiv (All)
open access
Scott topologies on meet-continuous domains
We study Scott products and sobriety of countable meet-continuous domains, meaning meet-continuous dcpos without any additional continuity or least-element assumption. Using the complete-lattice test-family theorem of Xu and Ji, we prove finite-product equality for those domains that are $L$-dcpos,
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sobriety of Scott topologies under countability conditions#1050190
- The product of two Scott sober complete lattices is not always Scott sober#1144213
- $C_σ$-Unique Dcpos: Intrinsic Characterizations and Counterexamples#1154455
- Distinct Consecutive Products#1011277
- Bounded VC-dimension implies the Erdős--Rado sunflower conjecture#1013150
Record · ID 1035682
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive