Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T21:15:04.801Z Has data issue: false hasContentIssue false

The characteristic sequence of a first-order formula

Published online by Cambridge University Press:  12 March 2014

M. E. Malliaris*
Affiliation:
Group in Logic, University of California at Berkeley, 910 Evans Hall, Berkeley, CA 94720, USA. E-mail: mem@math.berkeley.edu

Abstract

For a first-order formula φ(x; y) we introduce and study the characteristic sequence (Pn: n < ω) of hypergraphs defined by . We show that combinatorial and classification theoretic properties of the characteristic sequence reflect classification theoretic properties of φ and vice versa. The main results are a characterization of NIP and of simplicity in terms of persistence of configurations in the characteristic sequence. Specifically, we show that some tree properties are detected by the presence of certain combinatorial configurations in the characteristic sequence while other properties such as instability and the independence property manifest themselves in the persistence of complicated configurations under localization.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable