Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 
 

 

There's no forcing a least upper bound


Author: Robert S. Lubarsky
Journal: Proc. Amer. Math. Soc. 105 (1989), 998-1002
MSC: Primary 03E40; Secondary 03E45
DOI: https://doi.org/10.1090/S0002-9939-1989-0943796-8
MathSciNet review: 943796
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: While it is possible to have an increasing $ \omega $-sequence of $ c$-degrees with a least upper bound in a particular model of ZF, we show that it is not possible to force a sequence with a least upper bound absolute among all generic extensions of the original model


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 03E40, 03E45

Retrieve articles in all journals with MSC: 03E40, 03E45


Additional Information

DOI: https://doi.org/10.1090/S0002-9939-1989-0943796-8
Keywords: Degree of constructibility, forcing
Article copyright: © Copyright 1989 American Mathematical Society

American Mathematical Society