JavaScript is disabled for your browser. Some features of this site may not work without it.

- OpenUCT Home
- →
- Theses / Dissertations
- →
- Masters
- →
- View Item

dc.contributor.advisor | Rose, Henry | en_ZA |

dc.contributor.author | Fish, Washiela | en_ZA |

dc.date.accessioned | 2015-09-14T18:05:26Z | |

dc.date.available | 2015-09-14T18:05:26Z | |

dc.date.issued | 2000 | en_ZA |

dc.identifier.citation | Fish, W. 2000. Boolean ultrapowers. University of Cape Town. | en_ZA |

dc.identifier.uri | http://hdl.handle.net/11427/13892 | |

dc.description | Bibliography: leaves 121-122. | en_ZA |

dc.description.abstract | 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. | en_ZA |

dc.language.iso | eng | en_ZA |

dc.subject.other | Mathematics | en_ZA |

dc.title | Boolean ultrapowers | en_ZA |

dc.type | Master Thesis | |

uct.type.publication | Research | en_ZA |

uct.type.resource | Thesis | en_ZA |

dc.publisher.institution | University of Cape Town | |

dc.publisher.faculty | Faculty of Science | en_ZA |

dc.publisher.department | Department of Mathematics and Applied Mathematics | en_ZA |

dc.type.qualificationlevel | Masters | |

dc.type.qualificationname | MSc | en_ZA |

uct.type.filetype | Text | |

uct.type.filetype | Image | |

dc.identifier.apacitation | Fish, W. (2000). <i>Boolean ultrapowers</i>. (Thesis). University of Cape Town ,Faculty of Science ,Department of Mathematics and Applied Mathematics. Retrieved from http://hdl.handle.net/11427/13892 | en_ZA |

dc.identifier.chicagocitation | Fish, Washiela. <i>"Boolean ultrapowers."</i> Thesis., University of Cape Town ,Faculty of Science ,Department of Mathematics and Applied Mathematics, 2000. http://hdl.handle.net/11427/13892 | en_ZA |

dc.identifier.vancouvercitation | Fish W. Boolean ultrapowers. [Thesis]. University of Cape Town ,Faculty of Science ,Department of Mathematics and Applied Mathematics, 2000 [cited yyyy month dd]. Available from: http://hdl.handle.net/11427/13892 | en_ZA |

dc.identifier.ris | TY - Thesis / Dissertation AU - Fish, Washiela AB - 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. DA - 2000 DB - OpenUCT DP - University of Cape Town LK - https://open.uct.ac.za PB - University of Cape Town PY - 2000 T1 - Boolean ultrapowers TI - Boolean ultrapowers UR - http://hdl.handle.net/11427/13892 ER - | en_ZA |