MoL-2026-15: Li, Yipu (2026) Complexity Reduction in Combinatorial Set Theory. [Report]
Preview |
Text
MoL-2026-15.text.pdf - Published Version Download (486kB) | Preview |
Abstract
In this thesis, we study complexity reduction problems that originate from the analysis of definable combinatorial objects. We make significant progress in lifting a family of complexity reduction results to higher point classes. Specifically, we isolate a property we call Functional Projection that makes the complexity reduction proofs lift, and we establish that Functional Projection holds for all projective levels in the model L and L[U]. As a consequence, we derive the existence of combinatorial objects in L[U] at the optimal projective level \Pi^1_2.
| Item Type: | Report |
|---|---|
| Report Nr: | MoL-2026-15 |
| Series Name: | Master of Logic Thesis (MoL) Series |
| Year: | 2026 |
| Subjects: | Logic Mathematics |
| Depositing User: | Dr Marco Vervoort |
| Date Deposited: | 07 Sep 2026 13:00 |
| Last Modified: | 07 Sep 2026 13:00 |
| URI: | https://eprints.illc.uva.nl/id/eprint/2440 |
Actions (login required)
 |
View Item |
