Maximal sets in α-recursion theory
暂无分享,去创建一个
Let α be an admissible ordinal, and leta* be the Σ1-projectum ofa. Call an α-r.e. setM maximal if α→M is unbounded and for every α→r.e. setA, eitherA∩(α-M) or (α-A)∩(α-M) is bounded. Call and α-r.e. setM amaximal subset of α* if α*−M is undounded and for any α-r.e. setA, eitherA∩(α*-M) or (⇌*-A)∩(α*-M) is unbounded in α*. Sufficient conditions are given both for the existence of maximal sets, and for the existence of maximal subset of α*. Necessary conditions for the existence of maximal sets are also given. In particular, if α ≧ ℵL then it is shown that maximal sets do not exist.
[1] R. Jensen,et al. The fine structure of the constructible hierarchy , 1972 .
[2] K. Gödel. Consistency-Proof for the Generalized Continuum-Hypothesis. , 1939, Proceedings of the National Academy of Sciences of the United States of America.
[3] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[4] Gerald E. Sacks,et al. POST'S PROBLEM, ADMISSIBLE ORDINALS, AND REGULARITY , 1966 .
[5] A. Levy,et al. A hierarchy of formulas in set theory , 1965 .