Various authors (especially Scott, Egli, and Constable) have introduced concepts of "basis" for various classes of partially ordered sets (posets). This paper studies a basis concept directly analogous to the concept of a basis for a vector space. The new basis concept includes that of Egli and Constable as a special case, and one of their theorems is a corollary of our results. This paper also summarizes some previously reported but little known results of wide utility. For example, if every linearly ordered subset (chain) in a poset has a least upper bound (supremum), so does every directed subset.
Given posets P and Q, it is often useful to construct maps g: P → Q that are Chain-continuous: supremums of nonempty chains are preserved. Chain-continuity is analogous to topological continuity and is generally much more difficult to verify than isofonicity: the preservation of the order relation. This paper introduces the concept of an extension basis: a subset B of P such that any isotone f: B → Q has a unique chain-continuous extension g: P → Q. Two characterizations of the chain-complete posets that have extension bases are obtained. These results are then applied to the problem of constructing an extension basis for the poset [P → Q] of chain-continuous maps from P to Q, given extension bases for P and Q. This is not always possible, but it becomes possible when a mild (and independently motivated) restriction is imposed on either P or Q. A lattice structure is not needed.
[1]
Dana S. Scott,et al.
Outline of a Mathematical Theory of Computation
,
1970
.
[2]
D. Park,et al.
Induction Rules and Termination Proofs
,
1972,
ICALP.
[3]
Barry K. Rosen,et al.
Recursively defined data types: part 1
,
1973,
POPL.
[4]
R. P. Dilworth,et al.
Algebraic theory of lattices
,
1973
.
[5]
Jean-Jacques Lévy,et al.
Mechanizable Proofs about Parallel Processes
,
1973,
SWAT.
[6]
Jean Vuillemin,et al.
Correct and optimal implementations of recursion in a simple programming language
,
1973,
J. Comput. Syst. Sci..
[7]
Joseph A. Goguen,et al.
Initial Algebra Semantics
,
1974,
SWAT.
[8]
Barry K. Rosen,et al.
Program Equivalence and Context-Free Grammars
,
1972,
J. Comput. Syst. Sci..
[9]
Robert L. Constable,et al.
Computability concepts for programming language semantics
,
1975,
Theor. Comput. Sci..
[10]
G. Markowsky.
Chain-complete posets and directed sets with applications
,
1976
.
[11]
George Markowsky,et al.
Categories of Chain-Complete Posets
,
1977,
Theor. Comput. Sci..