{"title":"可容许序数的反射和划分性质","authors":"Evangelos Kranakis","doi":"10.1016/0003-4843(82)90022-5","DOIUrl":null,"url":null,"abstract":"<div><p>The present paper studies the relation between admissibility, reflection and partition properties. After introducing basic notions in Section e, <em>Σ</em><sub><em>n</em></sub> admissible ordinals are characterized using reflection properties (Section 2). <em>Σ</em><sub><em>n</em></sub> partition relations are introduced in Section 3. In Sections 3 and 4 connections are explored between partition properties, admissibility and projecta. Several more characterizations of admissibility are given in Section 5 (using <em>Σ</em><sub><em>n</em></sub> trees) and Section 6 (using <em>Σ</em><sub><em>n</em></sub> compactness). The ideas developed in Section 5 are used in Section 7 to study the partition relation <span><math><mtext>κ → </mtext><msup><mi></mi><mn><mtext>σ</mtext><msub><mi></mi><mn>n</mn></msub></mn></msup><mtext> (κ)</mtext><msup><mi></mi><mn>2</mn></msup></math></span>.</p></div>","PeriodicalId":100093,"journal":{"name":"Annals of Mathematical Logic","volume":"22 3","pages":"Pages 213-242"},"PeriodicalIF":0.0000,"publicationDate":"1982-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0003-4843(82)90022-5","citationCount":"13","resultStr":"{\"title\":\"Reflection and partition properties of admissible ordinals\",\"authors\":\"Evangelos Kranakis\",\"doi\":\"10.1016/0003-4843(82)90022-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The present paper studies the relation between admissibility, reflection and partition properties. After introducing basic notions in Section e, <em>Σ</em><sub><em>n</em></sub> admissible ordinals are characterized using reflection properties (Section 2). <em>Σ</em><sub><em>n</em></sub> partition relations are introduced in Section 3. In Sections 3 and 4 connections are explored between partition properties, admissibility and projecta. Several more characterizations of admissibility are given in Section 5 (using <em>Σ</em><sub><em>n</em></sub> trees) and Section 6 (using <em>Σ</em><sub><em>n</em></sub> compactness). The ideas developed in Section 5 are used in Section 7 to study the partition relation <span><math><mtext>κ → </mtext><msup><mi></mi><mn><mtext>σ</mtext><msub><mi></mi><mn>n</mn></msub></mn></msup><mtext> (κ)</mtext><msup><mi></mi><mn>2</mn></msup></math></span>.</p></div>\",\"PeriodicalId\":100093,\"journal\":{\"name\":\"Annals of Mathematical Logic\",\"volume\":\"22 3\",\"pages\":\"Pages 213-242\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1982-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0003-4843(82)90022-5\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Mathematical Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0003484382900225\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Mathematical Logic","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0003484382900225","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Reflection and partition properties of admissible ordinals
The present paper studies the relation between admissibility, reflection and partition properties. After introducing basic notions in Section e, Σn admissible ordinals are characterized using reflection properties (Section 2). Σn partition relations are introduced in Section 3. In Sections 3 and 4 connections are explored between partition properties, admissibility and projecta. Several more characterizations of admissibility are given in Section 5 (using Σn trees) and Section 6 (using Σn compactness). The ideas developed in Section 5 are used in Section 7 to study the partition relation .