Free algebras in Von Neumann-Bernays-Gӧdel set theory and positive elementary inductions in reasonable structures

This thesis consists of two independent chapters. The first chapter deals with universal algebra. It is shown, in von Neumann-Bernays-Gӧdel set theory, that free images of partial algebras exist in arbitrary varieties. It follows from this, as set-complete Boolean algebras form a variety, that there...

Full description

Bibliographic Details
Main Author: Rubin, Arthur
Format: Others
Language:en
Published: 1978
Online Access:https://thesis.library.caltech.edu/8901/1/Rubin_a_1978.pdf
Rubin, Arthur (1978) Free algebras in Von Neumann-Bernays-Gӧdel set theory and positive elementary inductions in reasonable structures. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/62t8-9b85. https://resolver.caltech.edu/CaltechTHESIS:05282015-144505104 <https://resolver.caltech.edu/CaltechTHESIS:05282015-144505104>
Description
Summary:This thesis consists of two independent chapters. The first chapter deals with universal algebra. It is shown, in von Neumann-Bernays-Gӧdel set theory, that free images of partial algebras exist in arbitrary varieties. It follows from this, as set-complete Boolean algebras form a variety, that there exist free set-complete Boolean algebras on any class of generators. This appears to contradict a well-known result of A. Hales and H. Gaifman, stating that there is no complete Boolean algebra on any infinite set of generators. However, it does not, as the algebras constructed in this chapter are allowed to be proper classes. The second chapter deals with positive elementary inductions. It is shown that, in any reasonable structure ᶆ, the inductive closure ordinal of ᶆ is admissible, by showing it is equal to an ordinal measuring the saturation of ᶆ. This is also used to show that non-recursively saturated models of the theories ACF, RCF, and DCF have inductive closure ordinals greater than <sub>ω</sub>.