11:00
First order theories as symmetric simplicial profinite sets
Abstract
We reformulate the statement that the theory of the free group is stable in terms of simplicial diagram chasing and profinite sets, without any terminology from logic. This includes three characterisations of stability (via indiscernible sequences, counting types, and definable types), and the notions of a first order theory and a model.
We do so by generalising slightly and allowing the universe of a first order structure/model to be an arbitrary (symmetric) simplicial set: formulas and basic predicates now may denote sets of simplices of an arbitrary (symmetric) simplicial set rather than sets of tuples of elements of a set. In this generalised sense the type space functor of a theory is its universal model classifying its usual models: taking the type of a tuple gives a map from a usual model of a theory to its type space functor. We define a property of simplicial maps weaker then being a fibration, and find it appears in the conditions characterising which maps correspond to models, when the generalised semantics is well-behaved, and which symmetric simplicial profinite sets correspond to first order theories.