Improving a bounding result for weakly-scattered theories
Name
71015183-MIT.pdf
Description
Full printable version
Size
1.72 MB
Format
Adobe PDF
Checksum (MD5)
3c1bc242bf74a8a25c272ced5fd480b7
Author(s)
Goddard, Christina M. (Christina Margaret)
Advisor(s)
Gerald E. Sacks.
Alternative Title
Ranks and Vaught's conjecture
Date Issued
2006
Publisher
Massachusetts Institute of Technology
Abstract
In this thesis, we effectively construct a predecessor function for the type definitions in the raw hierarchy for any weakly-scattered theory. Using this predecessor function, we improve a recent bounding result by Sacks for weakly-scattered theories by removing the assumption of a predecessor function from the k-splitting hypothesis. We begin by giving an introduction to the infinitary logic [...] and admissible sets. We then outline results by Sacks that are important in the construction of the predecessor function. We introduce scattered and weakly-scattered theories and their related hierarchies, and explain how they relate to the well-known Scott hierarchy. Using the raw tree hierarchy, we present Sacks' constructive result called the Effective Recovery Process. Using all of these tools, we provide a proof of the existence of a predecessor function for the type definitions and then use it to improve the bounding result by Sacks.
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2006.
Includes bibliographical references (p. 45).
Subjects
Mathematics.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
