研讨班报告

数理逻辑讨论班:A combinatorial argument of p=t

发布时间:2019-05-24

中科院数学与系统科学研究院

数学研究所 

数理逻辑讨论班 

报告人:Dr. Jialiang He(Bar Ilan University)

题  目:A combinatorial argument of p=t

时  间:2019.05.24(星期五), 14:00--16:00

地  点:数学院南楼N913室

摘  要: 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.

File name:

-

File size:

-

Title:

-

Author:

-

Subject:

-

Keywords:

-

Creation Date:

-

Modification Date:

-

Creator:

-

PDF Producer:

-

PDF Version:

-

Page Count:

-

Page Size:

-

Fast Web View:

-

Preparing document for printing…
0%