|
Organizers |
Maximal Point Spaces via Computable Completions
by
Jimmie Lawson
Louisiana State University
Sets equipped with a (computable) partial order and a compatible abstract (computable) approximation relation are introduced and an ideal completion appropriate for this context is considered. Various types of continuous domains arise via this construction. For the computable case, one has a natural notion of a computable point in the topological space consisting of the maximal points. Important classical examples such as the reals, Baire space, and the Cantor set are considered from this vantage point.
Date received: June 30, 1997
Copyright © 1997 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caao-53.