Professor, Academician of RAS
Sobolev Institute of Mathematics (Novosibirsk, Russia)
Slide of the Talk: World Logic Day. Mathematical Logic and Applications
The talk will be in Russian.
Professor
Department of Mathematics, University of Wisconsin–Madison, USA
Slide of the Talk: Degree Structures and Their Finite Substructures
Abstract: Many problems in mathematics can be viewed as being coded by sets of natural numbers (as indices). One can then define the relative computability of sets of natural numbers in various ways, each leading to a precise notion of “degree” of a problem (or set). In each case, these degrees form partial orders, which can be studied as algebraic structures.
The study of their finite substructures leads to a better understanding of the partial order as a whole.
Professor
Queens College, City University of New York, USA
Slide of the Talk: Lusin’s Theorem: How Computability Theory Proves a Real-Analysis Result