Hostname: page-component-7dd5485656-wlg5v Total loading time: 0 Render date: 2025-11-01T02:40:35.786Z Has data issue: false hasContentIssue false
  • English
  • Français

Recursive Embeddings of Partial Orderings

Published online by Cambridge University Press:  20 November 2018

K. R. Apt
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
Information
Canadian Journal of Mathematics , Volume 29 , Issue 2 , 01 April 1977 , pp. 349 - 359
Copyright
Copyright © Canadian Mathematical Society 1977

References

1. Abian, A., Categoricity of denumerable atomless Boolean rings, Studia Logica (1972), 63–68.Google Scholar
2. van Emde Boas, P., Mostowski's universal set-algebra, Mathematisch Centrum report, ZW 14/73, Amsterdam, 1973.Google Scholar
3. Shoenneld, J. R., Mathematical logic (Addison, Wesley, Reading, Massachusetts, 1967).Google Scholar
4. Sikorski, R., Boolean algebras, third edition (Berlin, 1969).Google Scholar