Show simple item record

dc.contributor.advisorGerald E. Sachs.en_US
dc.contributor.authorYoung, Jessica Millar, 1973-en_US
dc.contributor.otherMassachusetts Institute of Technology. Dept. of Mathematics.en_US
dc.date.accessioned2005-08-23T21:32:21Z
dc.date.available2005-08-23T21:32:21Z
dc.date.copyright2001en_US
dc.date.issued2001en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/8591
dc.descriptionThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2001.en_US
dc.descriptionIncludes bibliographical references (leaf 31).en_US
dc.description.abstractA set S of types over a theory T is strongly free if for all subsets X [strict subset] S, there is a countable model of T which realizes X and omits S\X. Throughout, all theories are assumed complete and consistent unless otherwise stated. Theorem 1 If all strongly free sets of types over a recursive theory T are finite, then T has a decidable prime model. Definition 2 A model is decidable if it is isomorphic to a model whose elementary diagram is recursive (technically speaking, this just means the model has a decidable presentation. Throughout this paper, however, we will just say the model is decidable} A classical result in model theory is that any theory with less than 2No many countable models must have a prime model. Our theorem gives an effective extension of this result: Corollary 3 If a countable theory T has less than 2No many countable models, then there is a prime model of T decidable in T.
dc.description.statementofresponsibilityby Jessica Millar Young.en_US
dc.format.extent31 leavesen_US
dc.format.extent2928275 bytes
dc.format.extent2928034 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectMathematics.en_US
dc.titleDecidable prime modelsen_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematics
dc.identifier.oclc49279996en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record