Все публикации

The theory of enumeration degrees and its fragments - Mariya Soskova

Dynamic Modalities for Social Networks II - Sonja Smets

Dynamic Modalities for Social Networks I - Sonja Smets

Some Open Questions and Recent Results in Computable Banach Spaces - Rod Downey

Further extensions of the point to set principle - Elvira Mayordomo

An introduction to Borel reducibility II - Matthew Harrison-Trainor

An introduction to Borel reducibility I - Matthew Harrison-Trainor

Provably Total NP Search Problems - Arnold Beckmann

Steffen Lempp (University of Wisconsin) - Minimal covers in the Weihrauch degrees

Isabella Scott (University of Chicago) - Effective constructions of existentially closed groups

Adam Topaz (University of Alberta) - Formalizing Lawvere theories in dependent type theory

Asymptotic notions of computability - Tiago Royer (UChicago) (part 2)

The omega-Vaught's Conjecture - David Gonzalez (Berkeley)

Computability Theoretic Aspects of Dobrinen’s Result on Triangle Free Graphs - Peter Cholak (ND)

Asymptotic notions of computability - Tiago Royer (UChicago) (part 1)

Borel order dimension - Dilip Raghavan (NUS)

Reverse Mathematics: A Global View - Richard Shore (Cornell University)

The strength of the existence of positive Friedberg numberings-Marta Fiori-Carones (Steklov Inst.)

Ramsey theory on infinite structures - Natasha Dobrinen (Notre Dame)

Weihrauch degrees above arithmetical transfinite recursion - Keita Yokoyama (Tohoku University)

Arrow's theorem and the reverse mathematics of social choice theory - Benedict Eastaugh (Warwick)

Provable better partial orders in reverse mathematics - Alberto Marcone (Udine)

The computability of the Tree Antichain Theorem - Chris Conidis (CUNY–Staten Island)

From Saturated Embeddings to Explicit Algorithms - Henry Towsner (Penn)

join shbcf.ru