{"title":"ω-有限集合理论的模型","authors":"A. Enayat, J. Schmerl, A. Visser","doi":"10.1017/CBO9780511910616.004","DOIUrl":null,"url":null,"abstract":"Finite set theory, here denoted ZFfin, is the theory ob- tained by replacing the axiom of infinity by its negation in the usual axiomatization of ZF (Zermelo-Fraenkel set theory). An !-model of ZFfin is a model in which every set has at most finitely many elements (as viewed externally). Mancini and Zambella (2001) em- ployed the Bernays-Rieger method of permutations to construct a recursive !-model of ZFfin that is nonstandard (i.e., not isomor- phic to the hereditarily finite sets V!). In this paper we initiate the metamathematical investigation of !-models of ZFfin. In par- ticular, we present a new method for building !-models of ZFfin that leads to a perspicuous construction of recursive nonstandard !-models of ZFfin without the use of permutations. Furthermore, we show that every recursive model of ZFfin is an !-model. The central theorem of the paper is the following:","PeriodicalId":161799,"journal":{"name":"Logic group preprint series","volume":"29 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"ω-Models of finite set theory\",\"authors\":\"A. Enayat, J. Schmerl, A. Visser\",\"doi\":\"10.1017/CBO9780511910616.004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Finite set theory, here denoted ZFfin, is the theory ob- tained by replacing the axiom of infinity by its negation in the usual axiomatization of ZF (Zermelo-Fraenkel set theory). An !-model of ZFfin is a model in which every set has at most finitely many elements (as viewed externally). Mancini and Zambella (2001) em- ployed the Bernays-Rieger method of permutations to construct a recursive !-model of ZFfin that is nonstandard (i.e., not isomor- phic to the hereditarily finite sets V!). In this paper we initiate the metamathematical investigation of !-models of ZFfin. In par- ticular, we present a new method for building !-models of ZFfin that leads to a perspicuous construction of recursive nonstandard !-models of ZFfin without the use of permutations. Furthermore, we show that every recursive model of ZFfin is an !-model. The central theorem of the paper is the following:\",\"PeriodicalId\":161799,\"journal\":{\"name\":\"Logic group preprint series\",\"volume\":\"29 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Logic group preprint series\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1017/CBO9780511910616.004\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Logic group preprint series","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1017/CBO9780511910616.004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Finite set theory, here denoted ZFfin, is the theory ob- tained by replacing the axiom of infinity by its negation in the usual axiomatization of ZF (Zermelo-Fraenkel set theory). An !-model of ZFfin is a model in which every set has at most finitely many elements (as viewed externally). Mancini and Zambella (2001) em- ployed the Bernays-Rieger method of permutations to construct a recursive !-model of ZFfin that is nonstandard (i.e., not isomor- phic to the hereditarily finite sets V!). In this paper we initiate the metamathematical investigation of !-models of ZFfin. In par- ticular, we present a new method for building !-models of ZFfin that leads to a perspicuous construction of recursive nonstandard !-models of ZFfin without the use of permutations. Furthermore, we show that every recursive model of ZFfin is an !-model. The central theorem of the paper is the following: