Graph explorer

Positive Definability Patterns

We reformulate Hrushovski's definability patterns from the setting of first order logic to the setting of positive logic. Given an h-universal theory T we put two structures on the type spaces of models of T in two languages, \mathcal{L} and \mathcal{L}_π. It turns out that for sufficiently saturated models, the corresponding h-universal theories \mathcal{T} and \mathcal{T}_π are independent of the model. We show that there is a canonical model \mathcal{J} of \mathcal{T}, and in many interesting cases there is an analogous canonical model \mathcal{J}_π of \mathcal{T}_π, both of which embed into every type space. We discuss the properties of these canonical models, called cores, and give some concrete examples.

3 nodes2 linksoverview previewPositive Definability Patterns
3 nodes2 links
Positive Definability Patterns3 visible / 3 total nodes / 2 links
AuthorshipTopic signalWPositive Definability Patternspreprint / 2022AOri SegelResearcherTmath.LO1661 works
PaperSignal 102 links

Positive Definability Patterns

preprint / 2022

Open