Related papers: A note on NSOP$_{1}$ in one variable
In this note let us give two remarks on proof-theory of PA. First a derivability relation is introduced to bound witnesses for provable $\Sigma_{1}$-formulas in PA. Second Paris-Harrington's proof for their independence result is…
The independence of the continuum hypothesis is a result of broad impact: it settles a basic question regarding the nature of N and R, two of the most familiar mathematical structures; it introduces the method of forcing that has become the…
We develop an abstract axiomatic theory of tie-breaking. A tie-breaking input consists of a finite set N of players, a weak order on N representing the standings to be refined, and an auxiliary information item drawn from a set on which the…
Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…
We provide an essentially complete dictionary of all implications among the basic and fundamental conditions in weighted theory such as the doubling, one weight A_p(w), A_\infty and C_p conditions as well as the two weight A_p and the…
Every experiment or observational study is made in a context. This context is being explicitly considered in this book. To do so, a conceptual variable is defined as any variable which can be defined by (a group of) researchers in a given…
We prove a dichotomy for $D$-rank 1 types in simple theories that generalizes Buechler's dichotomy for $D$-rank 1 minimal types in stable theories: every $D$-rank 1 type is either 1-based or part of its algebraic closure, defined by a…
We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…
We investigate the class of regular-ordered word equations. In such equations, each variable occurs at most once in each side and the order of the variables occurring in both sides is the preserved (the variables can be, however, separated…
We show that the unitary group of any SOT-separable $\mathrm{II}_1$ factor $M$, with the strong operator topology, is contractible. Combined with several old results, this implies that the same is true for any SOT-separable von Neumann…
We prove in this note a stabilized version of a conjecture on $\A^1$-connectedness. For the stabilized version of this conjecture, we introduce the notion of stable $\A^1$-connectedness, which is can be seen as the stabilization of…
We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…
Imagine being shown $N$ samples of random variables drawn independently from the same distribution. What can you say about the distribution? In general, of course, the answer is nothing, unless we have some prior notions about what to…
We prove that the homotopy theory of $N_\infty$ operads is equivalent to a homotopy theory of discrete operads, and we construct free and associative operadic realizations of every indexing system. This resolves a conjecture of Blumberg and…
We present an elementary combinatorial proof of the celebrated Friendship theorem. The proof involves looking at independent sets and constructing a bound on their size which forces a contradiction.
In this work we study some examples of groups definable and type-definable in NSOP1 theories. We exhibit some behaviors of these groups that differ from the ones of simple groups. We take interest in the notions of generics and stabilizers,…
We prove that for any monotone class of finite relational structures, the first-order theory of the class is NIP in the sense of stability theory if, and only if, the collection of Gaifman graphs of structures in this class is nowhere…
In this manuscript, a solution to Problem 18.91(b) in the Kourovka Notebook is given by proving the following theorem. Let $P$ be a Sylow $p$-subgroup of a group $G$ with $|P| = p^n$. Suppose that there is an integer $k$ such that $1 < k <…
For events $A$ and $B$, we have \[ \mathbb{P}(A\mid B) > \mathbb{P}(A\mid \neg B) \qquad\Longleftrightarrow\qquad \mathbb{P}(B\mid A) > \mathbb{P}(B\mid \neg A) \] whenever all four quantities are defined. In other words, $B$ is evidence…
We give a categorical proof of the projectivity of $N$ in the free topos -- in proof-theoretic terms, the rule of countable choice for intuitionistic higher-order logic -- based on the unpublished proof of Michael Makkai (c.1980). The…