A combinatorial argument of p=t, part 1
Seminar
Speaker
Jialiang He (BIU)
Date
08/04/2019 - 15:00 - 13:00Add to Calendar
2019-04-08 13:00:00
2019-04-08 15:00:00
A combinatorial argument of p=t, part 1
The Minimal Tower Problem was one of most famous question in Cardinal Invariants. We will present a combinatorial argument of this proof, which without using model theory and forcing, motivated by Malliaris and Shelah's proof.
Building 105, Room 61
אוניברסיטת בר-אילן - המחלקה למתמטיקה
mathoffice@math.biu.ac.il
Asia/Jerusalem
public
Place
Building 105, Room 61
Abstract
The Minimal Tower Problem was one of most famous question in Cardinal Invariants. We will present a combinatorial argument of this proof, which without using model theory and forcing, motivated by Malliaris and Shelah's proof.
תאריך עדכון אחרון : 28/10/2019
