Tona's Thesis Progress Tracker

1 Introduction

2 Descriptive Combinatorics

2.1 Background

2.2 A concise proof of the L0 dichotomy

2.3 A Ramsey-type theorem for E0 trees

2.4 Inexistence of a basis for digraphs of dichromatic number 3

2.5 Uncountable sets and an infinite linear order game

3 Deep Computations

3.1 Introduction

3.2 Connections to learning theory

3.3 The Bourgain-Fremlin-Talagrand theorems

3.4 The non-independence property

3.5 Compositional computation structures

3.6 Quantum logics

4 Group Actions on Graphs

4.1 Introduction

4.2 Border tracing in arbitrary adjacency graphs

4.3 Recursive constructions

4.4 Amoeba trees

4.5 Infinitary amoeba graphs

5 Closing Remarks and Open Problems

Analyzing work history...

Loading metadata...