Recursive Embeddings of Partial Orderings
Canadian journal of mathematics, Tome 29 (1977) no. 2, pp. 349-359
Voir la notice de l'article provenant de la source Cambridge University Press
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.
Apt, K. R. Recursive Embeddings of Partial Orderings. Canadian journal of mathematics, Tome 29 (1977) no. 2, pp. 349-359. doi: 10.4153/CJM-1977-038-5
@article{10_4153_CJM_1977_038_5,
author = {Apt, K. R.},
title = {Recursive {Embeddings} of {Partial} {Orderings}},
journal = {Canadian journal of mathematics},
pages = {349--359},
year = {1977},
volume = {29},
number = {2},
doi = {10.4153/CJM-1977-038-5},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1977-038-5/}
}
[1] 1. Abian, A., Categoricity of denumerable atomless Boolean rings, Studia Logica (1972), 63–68. Google Scholar
[2] 2. van Emde Boas, P., Mostowski's universal set-algebra, Mathematisch Centrum report, ZW 14/73, Amsterdam, 1973. Google Scholar
[3] 3. Shoenneld, J. R., Mathematical logic (Addison, Wesley, Reading, Massachusetts, 1967). Google Scholar
[4] 4. Sikorski, R., Boolean algebras, third edition (Berlin, 1969). Google Scholar
Cité par Sources :