Related papers: Explanation of Independence

We give an exposition of results of Baldwin-Shelah on saturated free algebras, at the level of generality of complete first order theories $T$ with a saturated model $M$ which is in the algebraic closure of an indiscernible set. We then…

We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…

These are the lecture notes of an introductory course on ordinal analysis. Our selection of topics is guided by the aim to give a complete and direct proof of a mathematical independence result: Kruskal's theorem for binary trees is…

We give conditions on a finite set of series of rational numbers to ensure that they are algebraically independent. Specialising our results to polynomials of lower degree, we also obtain new results on irrationality and $mathbb{Q}$-linear…

A criterion for elements of free Zinbiel algebras to be Lie or Jordan is established. This criterion is used in studying speciality problems of Tortkara algebras. We construct a base of free special Tortkara algebras. Furthermore, we prove…

We consider existentially closed fields with several orderings, valuations, and $p$-valuations. We show that these structures are NTP$_2$ of finite burden, but usually have the independence property. Moreover, forking agrees with dividing,…

We investigate several technical and conceptual questions. Our main subject is the investigation of independence as a ternary relation in the context of non-monotonic logic. In the context of probability, this investigation was started by…

Let $T_P$ be the theory of beautiful pairs of algebraically closed fields of fixed characteristic. It is known that for real tuples in models of $T_P$, SU-rank coincides with Morley rank and can be computed effectively. Building on Pillay's…

We describe a formal proof of the independence of the continuum hypothesis ($\mathsf{CH}$) in the Lean theorem prover. We use Boolean-valued models to give forcing arguments for both directions, using Cohen forcing for the consistency of…

A set of real $n$th roots that is pairwise linearly independent over the rationals must also be linearly independent. We show how this result may be extended to more general fields.

Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does…

Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…

This expository paper, aimed at the reader without much background in set theory or logic, gives an overview of Cohen's proof (via forcing) of the independence of the continuum hypothesis. It emphasizes the broad outlines and the intuitive…

A knot in $S^3$ is rationally slice if it bounds a disk in a rational homology ball. We give an infinite family of rationally slice knots that are linearly independent in the knot concordance group. In particular, our examples are all…

We study $N$-ary non-commutative notions of independence, which are given by trees and which generalize free, Boolean, and monotone independence. For every rooted subtree $\mathcal{T}$ of the $N$-regular tree, we define the…

A complete first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition.…

We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is…

The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…

We presents an independence relation on sets, one can define dimension by it, assuming that we have an abstract elementary class with a forking notion that satisfies the axioms of a good frame minus stability.

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…