filmov
tv
Все публикации
0:55:29
The theory of enumeration degrees and its fragments - Mariya Soskova
1:01:02
Dynamic Modalities for Social Networks II - Sonja Smets
1:02:21
Dynamic Modalities for Social Networks I - Sonja Smets
0:55:36
Some Open Questions and Recent Results in Computable Banach Spaces - Rod Downey
0:57:05
Further extensions of the point to set principle - Elvira Mayordomo
0:58:58
An introduction to Borel reducibility II - Matthew Harrison-Trainor
0:58:50
An introduction to Borel reducibility I - Matthew Harrison-Trainor
1:03:13
Provably Total NP Search Problems - Arnold Beckmann
0:47:48
Steffen Lempp (University of Wisconsin) - Minimal covers in the Weihrauch degrees
0:49:56
Isabella Scott (University of Chicago) - Effective constructions of existentially closed groups
0:48:27
Adam Topaz (University of Alberta) - Formalizing Lawvere theories in dependent type theory
0:47:48
Asymptotic notions of computability - Tiago Royer (UChicago) (part 2)
0:51:51
The omega-Vaught's Conjecture - David Gonzalez (Berkeley)
0:48:12
Computability Theoretic Aspects of Dobrinen’s Result on Triangle Free Graphs - Peter Cholak (ND)
0:06:43
Asymptotic notions of computability - Tiago Royer (UChicago) (part 1)
0:52:21
Borel order dimension - Dilip Raghavan (NUS)
1:01:29
Reverse Mathematics: A Global View - Richard Shore (Cornell University)
0:50:36
The strength of the existence of positive Friedberg numberings-Marta Fiori-Carones (Steklov Inst.)
0:49:26
Ramsey theory on infinite structures - Natasha Dobrinen (Notre Dame)
0:51:22
Weihrauch degrees above arithmetical transfinite recursion - Keita Yokoyama (Tohoku University)
1:02:16
Arrow's theorem and the reverse mathematics of social choice theory - Benedict Eastaugh (Warwick)
1:01:30
Provable better partial orders in reverse mathematics - Alberto Marcone (Udine)
0:50:58
The computability of the Tree Antichain Theorem - Chris Conidis (CUNY–Staten Island)
0:55:01
From Saturated Embeddings to Explicit Algorithms - Henry Towsner (Penn)
Вперёд
join shbcf.ru