Subfactors of index less than 5, part 1: the principal graph odometer

In this series of papers we show that there are exactly ten subfactors, other than $A_\infty$ subfactors, of index between 4 and 5. Previously this classification was known up to index $3+\sqrt{3}$. In the first paper we give an analogue of Haagerup's initial classification of subfactors of index less than $3+\sqrt{3}$, showing that any subfactor of index less than 5 must appear in one of a large list of families. These families will be considered separately in the three subsequent papers in this series.Comment: 36 pages (updated to reflect that the classification is now complete

Nonstandard Methods in Ramsey Theory and Combinatorial Number Theory

The goal of this present manuscript is to introduce the reader to the nonstandard method and to provide an overview of its most prominent applications in Ramsey theory and combinatorial number theory.Comment: 126 pages. Comments welcom

Interaction Graphs: Full Linear Logic

Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all Geometry of Interaction (GoI) constructions introduced so far. This series of work was inspired from Girard's hyperfinite GoI, and develops a quantitative approach that should be understood as a dynamic version of weighted relational models. Until now, the interaction graphs framework has been shown to deal with exponentials for the constrained system ELL (Elementary Linear Logic) while keeping its quantitative aspect. Adapting older constructions by Girard, one can clearly define "full" exponentials, but at the cost of these quantitative features. We show here that allowing interpretations of proofs to use continuous (yet finite in a measure-theoretic sense) sets of states, as opposed to earlier Interaction Graphs constructions were these sets of states were discrete (and finite), provides a model for full linear logic with second order quantification

Definable Structures on the Space of Functions from Tuples of Integers into 2

We give some background on the free part of the action of tuples of integers into 2. We will construct specific structures on this space, and then show that certain other structures cannot exist