Domain equations based on sets with families of pre-orders.

DOI10.1016/J.ENTCS.2009.11.029zbMATH Open1344.06004OpenAlexW1975181679MaRDI QIDQ2994482FDOQ2994482

Authors: Ligang Wu, Lei Fan 

Publication date: 1 August 2016

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.2009.11.029

Recommendations

• A fixed-point theorem for \(R\)-posets
• scientific article; zbMATH DE number 3940731
• Publication:4490751
• Elements of generalized ultrametric domain theory
• scientific article; zbMATH DE number 1231447

zbMATH Keywords

final coalgebrafixed pointsdomain equations\(\mathcal R\)-posetspre-order families

Mathematics Subject Classification ID

Partial orders, general (06A06) Fixed-point and coincidence theorems (topological aspects) (54H25) Semantics in the theory of computing (68Q55) Generalizations of ordered sets (06A75)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Elements of generalized ultrametric domain theory
• Topology, domain theory and theoretical computer science
• On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces

Cited In (3)

• Generalized Scott topology on sets with families of pre-orders
• A fixed-point theorem for \(R\)-posets
• Title not available (Why is that?)

This page was built for publication: Domain equations based on sets with families of pre-orders.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2994482)