On the Δ n 1 Problem of Harvey Friedman

Author:

Kanovei VladimirORCID,Lyubetsky VassilyORCID

Abstract

In this paper, we prove the following. If n≥3, then there is a generic extension of L, the constructible universe, in which it is true that the set P(ω)∩L of all constructible reals (here—subsets of ω) is equal to the set P(ω)∩Δn1 of all (lightface) Δn1 reals. The result was announced long ago by Leo Harrington, but its proof has never been published. Our methods are based on almost-disjoint forcing. To obtain a generic extension as required, we make use of a forcing notion of the form Q=Cℂ×∏νQν in L, where C adds a generic collapse surjection b from ω onto P(ω)∩L, whereas each Qν, ν<ω2L, is an almost-disjoint forcing notion in the ω1-version, that adjoins a subset Sν of ω1L. The forcing notions involved are independent in the sense that no Qν-generic object can be added by the product of C and all Qξ, ξ≠ν. This allows the definition of each constructible real by a Σn1 formula in a suitably constructed subextension of the Q-generic extension. The subextension is generated by the surjection b, sets Sω·k+j with j∈b(k), and sets Sξ with ξ≥ω·ω. A special character of the construction of forcing notions Qν is L, which depends on a given n≥3, obscures things with definability in the subextension enough for vice versa any Δn1 real to be constructible; here the method of hidden invariance is applied. A discussion of possible further applications is added in the conclusive section.

Funder

Russian Foundation for Basic Research

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Reference22 articles.

1. One hundred and two problems in mathematical logic

2. Surrealist landscape with figures (a survey of recent results in set theory)

3. The Constructible Reals Can Be (Almost) Anything. Preprint Dated May 1974 with the Following Addenda Dated up to October 1975: (A) Models Where Separation Principles Fail, May 74; (B) Separation without Reduction, April 75; (C) The Constructible Reals Can Be (Almost) Anything, Part II, May 75http://logic-library.berkeley.edu/catalog/detail/2135

4. Some applications of almost disjoint sets;Jensen,1970

5. Recursion-Theoretic Hierarchies;Hinman,1978

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3