Abstract
Suppose that P is a forcing notion, L is a language (in V), (Formula presented.) a P-name such that (Formula presented.) “(Formula presented.) is a countable L-structure”. In the product P × P, there are names (Formula presented.) such that for any generic filter G = G1 × G2 over P × P, (Formula presented.) and (Formula presented.). Zapletal asked whether or not (Formula presented.) implies that there is some M ∈ V such that (Formula presented.). We answer this question negatively and discuss related issues.
Original language | English |
---|---|
Pages (from-to) | 530-546 |
Number of pages | 17 |
Journal | Mathematical Logic Quarterly |
Volume | 62 |
Issue number | 6 |
DOIs | |
State | Published - 1 Dec 2016 |
All Science Journal Classification (ASJC) codes
- Logic