Related papers: NSOP$_1$-like independence in AECats
Connections between structural graph theory and finite model theory recently gained a lot of attention. In this setting, many interesting questions remain on the properties of dependent (NIP) hereditary classes of graphs, in particular…
Starting from an abstract elementary class with no maximal models, Shelah and Villaveces have shown (assuming instances of diamond) that categoricity implies a superstability-like property for a certain independence relation called…
We give a new characterization of $SOP$ (the strict order property) in terms of the behaviour of formulas in any model of the theory as opposed to having to look at the behaviour of indiscernible sequences inside saturated ones. We refine a…
We define weak stable Kim-forking, a notion that generalizes stable forking to the context of NSOP1 theories. We adapt some of the known results on stable forking to this context.
Semiring semantics for first-order logic provides a way to trace how facts represented by a model are used to deduce satisfaction of a formula. Team semantics is a framework for studying logics of dependence and independence in diverse…
Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…
We deal with stability theory for ``reasonable'' non-elementary classes without any remanents of compactness (like: above Hanf number or definable by L_{omega_1, omega}).
In Team Semantics, a dependency notion is strongly first order if every sentence of the logic obtained by adding the corresponding atoms to First Order Logic is equivalent to some first order sentence. In this work it is shown that all…
We give several characterizations of when a complete first-order theory $T$ is monadically NIP, i.e. when expansions of $T$ by arbitrary unary predicates do not have the independence property. The central characterization is a condition on…
We study one way in which stable phenomena can exist in an NIP theory. We start by defining a notion of 'pure instability' that we call 'distality' in which no such phenomenon occurs. O-minimal theories and the p-adics for example are…
Team Semantics generalizes Tarski's Semantics by defining satisfaction with respect to sets of assignments rather than with respect to single assignments. Because of this, it is possible to use Team Semantics to extend First Order Logic via…
We define the continuous modeling property for first-order structures and show that a first-order structure has the continuous modelling property if and only if its age has the embedding Ramsey property. We use generalized indiscernible…
Let K be an Abstract Elementary Class. Under the asusmptions that K has a nicely behaved forking-like notion, regular types and existence of some prime models we establish a decomposition theorem for such classes. The decomposition implies…
We prove several results on the behavior of Kim-independence upon changing the base in NSOP$_{1}$ theories. As a consequence, we prove that Kim-independence satisfies transitivity and that this characterizes NSOP$_{1}$. Moreover, we…
This paper continues math.LO/0009087. We present a rank function for NSOP_1 theories and give an example of a theory which is NSOP_1 but not simple. We also investigate the connection between maximality in the ordering <^* among complete…
We generalize the Unstable Formula Theorem characterization of stable theories from \citep{sh78}: that a theory $T$ is stable just in case any infinite indiscernible sequence in a model of $T$ is an indiscernible set. We use a generalized…
We study the generic theory of algebraically closed fields of fixed positive characteristic with a predicate for an additive subgroup, called $\mathrm{ACFG}$. This theory was introduced recently as a new example of $\mathrm{NSOP}_1$ non…
In this paper, we axiomatize the negatable consequences in dependence and independence logic by extending the systems of natural deduction of the logics given in (Kontinen and Vaananen 2013) and (Hannula 2015). We prove a characterization…
We present here some known and some new examples of non-simple NSOP1 theories and some behaviour that Kim-forking can exhibit in these theories, in particular that Kim-forking after forcing base monotonicity can or can not satisfy extension…
We introduce the notion of first order amenability, as a property of a first order theory $T$: every complete type over $\emptyset$, in possibly infinitely many variables, extends to an automorphism-invariant global Keisler measure in the…