Bases for chain-complete posets
- 1 October 1975
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 34-47
- https://doi.org/10.1109/sfcs.1975.7
Abstract
Given partially ordered sets (posets) P and Q, it is often useful to construct maps g:P→Q which are chain-continuous: least upper bounds (supremums) of nonempty linearly ordered subsets are preserved. Chaincontinuity is analogous to topological continuity and is generally much more difficult to verify than isotonicity: 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 which 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. Finally, we consider extension bases which can be recursively listed and derive a recently established theorem as a corollary.Keywords
This publication has 4 references indexed in Scilit:
- Initial algebra semanticsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1974
- Mechanizable proofs about parallel processesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973
- Correct and optimal implementations of recursion in a simple programming languagePublished by Association for Computing Machinery (ACM) ,1973
- Program equivalence and context-free grammarsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972