Domain Equations Based on Sets with Families of Pre-orders

Authors:
Li-Gang Wu;Lei Fan
Affiliations:
Institute of Mathematics and Interdisciplinary Science, School of Mathematics Science, Capital Normal University, Beijing, 100048, P.R.China;Department of Educational Technology, Capital Normal University, Beijing, 100048, P.R.China
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 7
Cited 0

Mathematical theory of domains

Mathematical theory of domains
Domain theory

Handbook of logic in computer science (vol. 3)
Quasi Uniformities: Reconciling Domains with Metric Spaces

Proceedings of the 3rd Workshop on Mathematical Foundations of Programming Language Semantics
Elements of generalized ultrametric domain theory

Elements of generalized ultrametric domain theory
On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces

Mathematical Structures in Computer Science
The category-theoretic solution of recursive domain equations

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A Kind of R-Complete Category for R-Posets

CSO '09 Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization - Volume 01

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we are interested in finding solutions of domain equations based on posets with families of pre-orders. Let (P,@?) be a poset and let (@w,=