Scott Continuity
In mathematics, given two partially ordered sets P and Q a function between them is Scott-continuous (named after the mathematician Dana Scott) if it preserves all directed suprema, i.e. if for every directed subset D of P with supremum in P its image has a supremum in Q, and that supremum is the image of the supremum of D: sup f(D) = f(sup D).
A subset O of a partially ordered set P is called Scott-open if it is an upper set and if it is inaccessible by directed joins, i.e. if all directed sets D with supremum in O have non-empty intersection with O. The Scott-open subsets of a partially ordered set P form a topology on P, the Scott topology. A function between partially ordered sets is Scott-continuous if and only if it is continuous with respect to the Scott topology.
The Scott topology was first defined by Dana Scott for complete lattices and later defined for arbitrary partially ordered sets.
Scott-continuous functions show up in the study of models for lambda calculi and the denotational semantics of computer programs.
Read more about Scott Continuity: Properties, Examples
Famous quotes containing the words scott and/or continuity:
“Grown up, and that is a terribly hard thing to do. It is much easier to skip it and go from one childhood to another.”
—F. Scott Fitzgerald (1896–1940)
“If you associate enough with older people who do enjoy their lives, who are not stored away in any golden ghettos, you will gain a sense of continuity and of the possibility for a full life.”
—Margaret Mead (1901–1978)