Maximality and totality of stable functions in the category of stable bifinite domains

Authors:
Yixiang Chen;Guo-Qiang Zhang
Affiliations:
-;-
Venue:
Computers & Mathematics with Applications
Year:
2006

Citing 8
Cited 1

The system F of variable types, fifteen years later

Theoretical Computer Science
Linear logic

Theoretical Computer Science
Stable neighbourhoods

Theoretical Computer Science
On stable domains

Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
Games and full completeness for multiplicative linear logic

Journal of Symbolic Logic
On maximal stable functions

Theoretical Computer Science
Stable Models of Typed lambda-Calculi

Proceedings of the Fifth Colloquium on Automata, Languages and Programming
On an open problem of Amadio and Curien: The finite antichain condition

Information and Computation

Domain semantics of possibility computations

Information Sciences: an International Journal

Quantified Score

Hi-index	0.09

Visualization

Abstract

This paper studies maximality and totality of stable functions in the category of stable bifinite domains. We present three main results as follows,o(1)every maximum-preserving function is a maximal element in the stable function spaces; (2)a maximal stable function f : D - E is maximum-preserving if D is maximum-separable and E is completely separable; and (3)a stable bifinite domain D is maximum-separable if and only if for any locally distributive stable bifinite domain E, each maximal stable function f : D - E is maximum-preserving.