Show simple item record

Complete topoi representing models of set theory

dc.contributor.authorBlass, Andreasen_US
dc.contributor.authorScedrov, Andrejen_US
dc.date.accessioned2006-04-10T15:13:28Z
dc.date.available2006-04-10T15:13:28Z
dc.date.issued1992-05-06en_US
dc.identifier.citationBlass, Andreas, Scedrov, Andre (1992/05/06)."Complete topoi representing models of set theory." Annals of Pure and Applied Logic 57(1): 1-26. <http://hdl.handle.net/2027.42/30052>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B6TYB-45F5R5T-5/2/eed8175516fe472b81d293519cb237ffen_US
dc.identifier.urihttps://hdl.handle.net/2027.42/30052
dc.description.abstractBy a model of set theory we mean a Boolean-valued model of Zermelo-Fraenkel set theory allowing atoms (ZFA), which contains a copy of the ordinary universe of (two-valued,pure) sets as a transitive subclass; examples include Scott-Solovay Boolean-valued models and their symmetric submodels, as well as Fraenkel-Mostowski permutation models. Any such model M can be regarded as a topos. A logical subtopos of M is said to represent M if it is complete and its cumulative hierarchy, as defined by Fourman and Hayashi, coincides with the usual cumulative hierarchy of M. We show that, although M need not be a complete topos, it has a smallest complete representing subtopos, and we describe this subtopos in terms of definability in M. We characterize, again in terms of definability, those models M whose smallest representing topos is a Grothendieck topos. Finally, we discuss the extent to which a model can be reconstructed when its smallest representing topos is given.en_US
dc.format.extent1952807 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleComplete topoi representing models of set theoryen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumMathematics Department, University of Michigan, Ann Arbor, MI 48109, USAen_US
dc.contributor.affiliationotherMathematics Department, University of Pennsylvania, Philadelphia, PA 19104, USAen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/30052/1/0000420.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/0168-0072(92)90059-9en_US
dc.identifier.sourceAnnals of Pure and Applied Logicen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.