Almost Every Domain is Universal

DOI10.1016/j.entcs.2007.02.030zbMath1316.68066OpenAlexW2023796153MaRDI QIDQ5262933

Manfred Droste, Dietrich Kuske

Publication date: 10 July 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.02.030

zbMATH Keywords

constructive mathematicsdomain theorytopological modelsprobabilistic systemsuniversal homogeneous domains

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Countable random 𝑝-groups with prescribed Ulm-invariants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Projective topology on bifinite domains and applications
• Theory of relations. Transl. from the French by P. Clote
• Universal profinite domains
• \(\mathbb{T}^\omega\) as a universal domain
• Coherence and consistency in domains
• On random relational structures
• Random orders and gambler's ruin
• UNIVERSAL INFORMATION SYSTEMS
• Universal homogeneous causal sets
• Finite Axiomatizations for Universal Domains
• Data Types as Lattices
• Universal domains and the amalgamation property
• Universal graphs and universal functions
• Asymmetric graphs
• Sur l'extension aux relations de quelques propriétés des ordres
• Pseudo-retract functors for local lattices and bifinte L-domains

This page was built for publication: Almost Every Domain is Universal