相关论文: More on SOP_1 and SOP_2
This paper investigates a connection between the ordering triangleleft^ast among theories in model theory and the (N)SOP_n hierarchy of Shelah. It introduces two properties which are natural extensions of this hierarchy, called SOP_2 and…
We give several new characterizations of $IP$ (the independence property) and $SOP$ (the strict order property) for continuous first order logic and study their relations to the function theory and the Banach space theory. We suggest new…
The paper deals with two issues: the existence of universal models of a theory T and related properties when cardinal arithmetic does not give this existence offhand. In the first section we prove that simple theories (e.g., theories…
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…
In the classification of complete first-order theories, many dividing lines have been defined in order to understand the complexity and the behavior of some classes of theories. In this paper, using the concept of patterns of consistency…
In this paper, we study some tree properties and their related indiscernibilities. First, we prove that SOP$_2$ can be witnessed by a formula with a tree of tuples holding 'arbitrary homogeneous inconsistency' (e.g., weak k-TP$_1$…
In this paper we give characterizations of the super-stable theories, in terms of an external property called representation. In the sense of the representation property, the mentioned class of first-order theories can be regarded as "not…
A relevant thesis is that for the family of complete first order theories with NIP (i.e. without the independence property) there is a substantial theory, like the family of stable (and the family of simple) first order theories. We examine…
We give definitions of the properties OP, IP, $k$-TP, TP$_1$, $k$-TP$_2$, SOP$_1$, SOP$_2$ and SOP$_3$ in positive logic, and prove various implications and equivalences between them. We also provide a characterisation of stability in…
We study and characterize stability, NIP and NSOP in terms of topological and measure theoretical properties of classes of functions. We study a measure theoretic property, `Talagrand's stability', and explain the relationship between this…
In continuous logic, there are plenty of examples of interesting stable metric structures. However, on the other side of the SOP line, there are only a few metric structures where order is relevant, and orders often appear in different…
An important dividing line in the class of unstable theories is being NSOP$_1$, which is more general than being simple. In NSOP$_1$ theories forking independence may not be as well-behaved as in stable or simple theories, so it is replaced…
We show that every unstable NIP theory admits a V-definable linear quasi-order, over a finite set of parameters. In particular, if the theory is omega-categorical, then it interprets an infinite linear order. This partially answers a…
We investigate the extent of second order characterizable structures by extending Shelah's Main Gap dichotomy to second order logic. For this end we consider a countable complete first order theory T. We show that all sufficiently large…
A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…
Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…
A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; the core companion of a theory $T$ is a model-complete core theory $S$ such that every model…
The main purpose of this paper is to present a new and more uniform model-theoretic/combinatorial proof of the theorem ([5]): The randomization $T^{R}$ of a complete first-order theory $T$ with $NIP$ is a (complete) first-order continuous…
The $k$-dimensional functional order property ($\text{FOP}_k$) is a combinatorial property of a $(k+1)$-partitioned formula. This notion arose in work of Terry and Wolf, which identified $\text{NFOP}_2$ as a ternary analogue of stability in…
Dividing asks about inconsistency along indiscernible sequences. In order to study the finer structure of simple theories without much dividing, the authors recently introduced shearing, which essentially asks about inconsistency along…