Tree Forcing And Definable Maximal Independent Sets In Hypergraphs
Work
Year: 2022
Type: article
Abstract: We show that after forcing with a countable support iteration or a finite product of Sacks or splitting forcing over L , every analytic hypergraph on a Polish space admits a $\mathbf {\Delta }^1_2$ m... more
Source: Journal of Symbolic Logic
Author Jonathan Schilhan
Cites: 30
Cited by: 4
Related to: 10
FWCI: 1.169
Citation percentile (by year/subfield): 66.33
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green