Forcing models satisfying the genericity property — Problem 8.1
Forcing models satisfying the genericity property — Problem 8.1. Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.
Editorial MSC2020 mapping of Forcing models satisfying the genericity property — Problem 8.1. https://arxiv.org/html/2608.26628v2#S8.Thmproblem1 Not an author-supplied code.
Problem statement
Problem 8.1.
Find more models and forcing notions such that is true.
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
- Hang Zhang
The following questions are motivated by the problem whether hyper-hyperfiniteness implies hyperfiniteness.
Let be a countable model for a sufficiently large fragment of ZFC. Suppose that a partial order is in . Define the space of -generics for by
If we identify as a subspace of with the product topology, then is in and thus a Polish space. See [1] for details. Define if and only if . Consider the equivalence relation on .
Example 8.1.
(Calderoni–Sinapova [2]) Let be a countable model for large fragment ZFC. Suppose is measurable (witnessed by ). If , with order . Then for any generic sequences of over ,
Remark 8.2 ([1, Theorem 3.1]).
If (Cohen forcing), then ”” is hyper-hyperfinite.
Remark 8.3.
If
is Cohen, then
is also Cohen. Notice that these two Cohen reals lead to the same forcing extension. So Cohen forcing does not satisfy (*) for any .
Progress & source assessment
Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.
- [1]Barmpalias, George; Gao, Su; He, Jialiang; Kihara, Takayuki; Nies, Andre; Slaman, Theodore; Tran, Chieu-Minh; Turetsky, Daniel; Welch, Philip; Yu, Liang; Zhang, Hang. Tianyuan Workshop — Open Problems in Mathematical Logic (2026).; Forcing models satisfying the genericity property — Problem 8.1 linkhttp://creativecommons.org/licenses/by/4.0/; attributed adaptation; HTML converted to Markdown with original mathematical notation and source links.
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.