Introduces F_ind, F_Mb, definable Morley property and n-resolvability for indiscernible sequences, proves Koponen's conjecture that simple theories with QE in finite relational languages have finite rank and are one-based, and establishes variants of the simple Kim-forking conjecture in NSOP1.
Math1050 combinatorial mathematics.https://sites.pitt.edu/ ˜kaveh/Chap7-MATH1050.pdf, 2013
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Simple Homogeneous Structures and Indiscernible Sequence Invariants
Introduces F_ind, F_Mb, definable Morley property and n-resolvability for indiscernible sequences, proves Koponen's conjecture that simple theories with QE in finite relational languages have finite rank and are one-based, and establishes variants of the simple Kim-forking conjecture in NSOP1.