Loading...
Please wait, while we are loading the content...
Similar Documents
Representing Sets of Ordinals as Countable Unions of Sets in the Core Model
| Content Provider | Scilit |
|---|---|
| Author | Magidor, Menachem |
| Copyright Year | 1990 |
| Description | We prove the following theorems. Theorem 1 $(\neg {0^\# })$. Every set of ordinals which is closed under primitive recursive set functions is a countable union of sets in $L$. Theorem 2. (No inner model with an Erdàs cardinal, i.e. $\kappa \to {({\omega _1})^{ < \omega }}$.) For every ordinal $\beta$, there is in $K$ an algebra on $\beta$ with countably many operations such that every subset of $\beta$ closed under the operations of the algebra is a countable union of sets in $K$. |
| Related Links | https://www.ams.org/tran/1990-317-01/S0002-9947-1990-0939805-5/S0002-9947-1990-0939805-5.pdf |
| ISSN | 00029947 |
| e-ISSN | 10886850 |
| DOI | 10.2307/2001455 |
| Journal | Transactions of the American Mathematical Society |
| Issue Number | 1 |
| Volume Number | 317 |
| Language | English |
| Publisher | Duke University Press |
| Publisher Date | 1990-01-01 |
| Access Restriction | Open |
| Subject Keyword | Logic Ordinals Countable Union Functions Omega Core Model Primitive Recursive Erdàs Cardinal Recursive Set |
| Content Type | Text |
| Resource Type | Article |
| Subject | Applied Mathematics |
