Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-18T15:08:55.954Z Has data issue: false hasContentIssue false

Recursive Embeddings of Partial Orderings

Published online by Cambridge University Press:  20 November 2018

K. R. Apt*
Affiliation:
Mathematical Centre, 2e Boerhaavestraat 49, Amsterdam 1005, The Netherlands
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let 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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1977