In this paper we discuss several generalization of theorems from stability theory to simple theories. Cherlin and Hrushovski, in [2] develop a substitute for canonical bases in finite rank, ω-categorical supersimple theories. Motivated by methods there, we prove the existence of canonical bases (in a suitable sense) for types in any simple theory. This is done in Section 2. In general these canonical bases will (as far as we know) exist only as “hyperimaginaries”, namely objects of the forma/Ewhereais a possibly (...) infinite tuple andEa type-definable equivalence relation. (In the supersimple, ω-categorical case, these reduce to ordinary imaginaries.) So in Section 1 we develop the general theory of hyperimaginaries and show how first order model theory (including the theory of forking) generalises to hyperimaginaries. We go on, in Section 3 to show the existence and ubiquity of regular types in supersimple theories, ω-categorical simple structures and modularity is discussed in Section 4. It is also shown here how the general machinery of simplicity simplifies some of the general theory of smoothly approximable (or Lie-coordinatizable) structures from [2].Throughout this paper we will work in a large, saturated modelMof a complete theoryT. All types, sets and sequences will have size smaller than the size ofM. We will assume that the reader is familiar with the basics of forking in simple theories as laid out in [4] and [6]. For basic stability-theoretic results concerning regular types, orthogonality etc., see [1] or [9]. (shrink)

We give definitions that distinguish between two notions of indiscernibility for a set {aη∣η∈ω>ω}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\{a_{\eta} \mid \eta \in ^{\omega>}\omega\}}$$\end{document} that saw original use in Shelah [Classification theory and the number of non-isomorphic models. North-Holland, Amsterdam, 1990], which we name s- and str−indiscernibility. Using these definitions and detailed proofs, we prove s- and str-modeling theorems and give applications of these theorems. In particular, we verify a step in the argument that TP is equivalent (...) to TP1 or TP2 that has not seen explication in the literature. In the Appendix, we exposit the proofs of Shelah [Classification theory and the number of non-isomorphic models. North-Holland, Amsterdam, 1990, App. 2.6, 2.7], expanding on the details. (shrink)

A ternary relation [Formula: see text] between subsets of the big model of a complete first-order theory T is called an independence relation if it satisfies a certain set of axioms. The primary example is forking in a simple theory, but o-minimal theories are also known to have an interesting independence relation. Our approach in this paper is to treat independence relations as mathematical objects worth studying. The main application is a better understanding of thorn-forking, which turns out to be (...) closely related to modular pairs in the lattice of algebraically closed sets. (shrink)