Almost every domain is universal
DOI10.1016/J.ENTCS.2007.02.030zbMATH Open1316.68066OpenAlexW2023796153MaRDI QIDQ5262933FDOQ5262933
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
Recommendations
constructive mathematicsdomain theorytopological modelsprobabilistic systemsuniversal homogeneous domains
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Continuous lattices and posets, applications (06B35) Semantics in the theory of computing (68Q55)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of relations. Transl. from the French by P. Clote
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(\mathbb{T}^\omega\) as a universal domain
- 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
- Title not available (Why is that?)
- Universal homogeneous causal sets
- On random relational structures
- Title not available (Why is that?)
- UNIVERSAL INFORMATION SYSTEMS
- Universal profinite domains
- Finite Axiomatizations for Universal Domains
- Projective topology on bifinite domains and applications
- Coherence and consistency in domains
- Random orders and gambler's ruin
- Pseudo-retract functors for local lattices and bifinte L-domains
Cited In (3)
This page was built for publication: Almost every domain is universal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262933)
