Related papers: A note on NSOP$_{1}$ in one variable
The change of variable theorem is proved under the sole hypothesis of differentiability of the transformation. Specifically, it is shown under this hypothesis that the transformed integral equals the given one over every measurable subset…
We use axioms of abstract ternary relations to define the notion of a free amalgamation theory. These form a subclass of first-order theories, without the strict order property, encompassing many prominent examples of countable structures…
We extend to several variables an earlier result of ours, according to which an entire function of one variable of sufficiently small exponential type, having all derivatives of even order taking integer values at two points, is a…
A dependent theory is a (first order complete theory) T which does not have the independence property. A main result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being…
Given a first-order theory and a proof that it is consistent, can we design a proof-search method for this theory that fails in finite time when it attempts to prove the formula False?
This paper describes Simpson's paradox, and explains its serious implications for randomised control trials. In particular, we show that for any number of variables we can simulate the result of a controlled trial which uniformly points to…
We observe that a simple condition suffices to describes non-forking independence over models in a stable theory. Under mild assumptions, this description can be extended to non-forking independence over algebraically closed subsets,…
We show that the theory of the free group -- and more generally the theory of any torsion-free hyperbolic group -- is $n$-ample for any $n\geq 1$. We give also an explicit description of the imaginary algebraic closure in free groups.
We make two contributions to the study of polite combination in satisfiability modulo theories. The first contribution is a separation between politeness and strong politeness, by presenting a polite theory that is not strongly polite. This…
We characterize stable T for which the model completion of T_{aut} is stable (i.e., every completion is). Then we prove that ``some completion is stable'' is different and we characterize it. Finally we show that if T is stable, T_{aut} has…
We prove that P != NP by proving the existence of a class of functions we call Tau, each of whose members satisfies the conditions of one-way functions. Each member of Tau is a function computable in polynomial time, with negligible…
We exhibit here, for a scalar theory, an apparently non-trivial Wilsonian fixed point, which surprisingly describes a free theory. This modest note is an observation which can be of interest in the framework of functional methods in Quantum…
We give sufficient conditions for a predicate P in a complete theory T to be stably embedded: P with its induced 0-definable structure has "finite rank", P has NIP in T and P is 1-stably embedded. This generalizes recent work by Hasson 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…
Von Neumann use 4 assumptions to derive the Hilbert space (HS) formulation of quantum mechanics (QM). Within this theory dispersion free ensembles do not exist. To accommodate a theory of quantum mechanics that allow dispersion free…
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$…
A study of the set N_p of positive integers which occur as orders of nonsingular derivations of finite-dimensional non-nilpotent Lie algebras of characteristic p>0 was initiated by Shalev and continued by the present author. The main goal…
In the first part of this work the notion of stable Kim-forking is discussed and some context on this matter is given. In the second part a general way of building some examples of NSOP1 theories as the limit of some Fraisse class…
A new theory of programming is proposed. The theory consists of OE (Operation Expression), SP (Semantic Predicate) and A (Axiom), abbreviated as OESPA. OE is for programming: its syntax is given by BNF formulas and its semantics is defined…
We give a simple proof that the first-order theory of well orders is axiomatized by transfinite induction, and that it is decidable.