Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
1998.
Handbook of Recursive Mathematics - Volume 1: Recursive Model Theory.
Vol. 138,
Issue. ,
p.
515.

be a countable atomless Boolean algebra and let X be a countable partial ordering. We prove that there exists an embedding of X into
which is recursive in X,
and which destroys all suprema and infima of X which can be destroyed. We show that the above theorem is false when we try to preserve all suprema and infima of X instead of destroying them.