Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Bibliography: leaves 121-122.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
Department of Mathematics and Applied Mathematics
2015
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867613236618067968 |
|---|---|
| access_status_str | Open Access |
| author | Fish, Washiela |
| author2 | Rose, Henry |
| author_browse | Fish, Washiela Rose, Henry |
| author_facet | Rose, Henry Fish, Washiela |
| author_sort | Fish, Washiela |
| collection | Thesis |
| description | Bibliography: leaves 121-122. |
| format | Thesis |
| id | oai:open.uct.ac.za:11427/13892 |
| institution | University of Cape Town (South Africa) |
| language | eng |
| last_indexed | 2026-06-10T12:32:56.154Z |
| license_str | Not specified — see source repository |
| provenance_str_mv | Harvested via OAI-PMH from UCTD — University of Cape Town Open Access Repository |
| publishDate | 2015 |
| publishDateRange | 2015 |
| publishDateSort | 2015 |
| publisher | Department of Mathematics and Applied Mathematics |
| publisherStr | Department of Mathematics and Applied Mathematics |
| record_format | dspace |
| source_str | UCTD — University of Cape Town Open Access Repository |
| spelling | oai:open.uct.ac.za:11427/13892 Boolean ultrapowers Fish, Washiela Rose, Henry Mathematics Bibliography: leaves 121-122. The Boolean ultrapower construction is a generalisation of the ordinary ultrapower construction in that an arbitrary complete Boolean algebra replaces the customary powerset Boolean algebra. B. Koppelberg and S. Koppelberg [1976] show that the class of ordinary ultrapowers is properly contained in the class of Boolean ultrapowers thereby justifying the development of a theory for Boolean ultrapowers. This thesis is an exploration into the strategies whereby and the conditions under which aspects of the theory of ordinary ultrapowers can be extended to the theory of Boolean ultrapowers. Mansfield [1971] shows that a finitely iterated Boolean ultrapower is isomorphic to a single Boolean ultrapower under certain conditions. Using a different approach and under somewhat different conditions, Ouwehand and Rose [1998] show that the result also holds for K-bounded Boolean ultrapowers. Mansfield [1971] also proves a Boolean version of the Keisler-Shelah theorem. By redefining the notion of a K-good ultrafilter on a Boolean algebra, Benda [1974] obtains a complete generalisation of a theorem of Keisler which states that an ultrapower is K-saturated iff the ultrafilter is K-good. Potthoff [1974] defines the notion of a limit Boolean ultrapower and shows that, as is the case for ordinary ultrapowers, the complete extensions of a model are characterised by its limit Boolean ultrapowers. Upon the discovery by Frayne, Morel and Scott [1962] of an ultrapower of a simple group which is not simple, Burris and Jeffers [1978] investigate necessary and sufficient conditions for a Boolean ultrapower to be simple, or subdirectly irreducible, provided that the language is countable. Finally, Jipsen, Pinus and Rose [2000] extend the notion of the Rudin-Keisler ordering to ultrafilters on complete Boolean algebras, and prove that by using this definition, Blass' Characterisation Theorem can be generalised for Boolean ultrapowers. 2015-09-14T18:05:26Z 2015-09-14T18:05:26Z 2000 Master Thesis Masters MSc http://hdl.handle.net/11427/13892 eng application/pdf Department of Mathematics and Applied Mathematics Faculty of Science University of Cape Town |
| spellingShingle | Mathematics Fish, Washiela Boolean ultrapowers |
| thesis_degree_str | Master's |
| title | Boolean ultrapowers |
| title_full | Boolean ultrapowers |
| title_fullStr | Boolean ultrapowers |
| title_full_unstemmed | Boolean ultrapowers |
| title_short | Boolean ultrapowers |
| title_sort | boolean ultrapowers |
| topic | Mathematics |
| url | http://hdl.handle.net/11427/13892 |
| work_keys_str_mv | AT fishwashiela booleanultrapowers |