Related papers: NIP formulas and Baire 1 definability
The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…
If there exists a completely bounded projection of B(H) onto a von Neumann algebra M on H, then M is injective. If there exists a bounded projection and M is properly infinite, the same conclusion holds.
$IP$ sets play fundamental role in arithmetic Ramsey theory. A set is called an additive $IP$ set if it is of the form $FS\left(\langle x_{n}\rangle_{n\in \mathbb{N}}\right)=\left\{ \sum_{t\in H}x_{t}:H\right.$ is a nonempty finite subset…
We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory $T$ is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model $M$ of $T$ has an expansion…
We prove an assortment of results on (commutative and unital) NIP rings, especially $\mathbb{F}_p$-algebras. Let $R$ be a NIP ring. Then every prime ideal or radical ideal of $R$ is externally definable, and every localization $S^{-1}R$ is…
We compare three notions of effectiveness on uncountable structures. The first notion is that of a $\real$-computable structure, based on a model of computation proposed by Blum, Shub, and Smale, which uses full-precision real arithmetic.…
We give a short proof of an improved version of the Effros Open Mapping Principle via a shift-compactness theorem (also with a short proof), involving `sequential analysis' rather than separability, deducing it from the Baire property in a…
We are proving the following: (1) If $\kap$ is a weakly inaccessible then $NS_\kap$ is not $\kap^+$-saturated. (2) If $\kap$ is a weakly inaccessible and $\tet <\kap$ is regular then $NS^\tet_\kap$ is not $\kap^+$-saturated. (3) If $\kap$…
We look at characterizing which formulas are expressible in rich decidable logics such as guarded fixpoint logic, unary negation fixpoint logic, and guarded negation fixpoint logic. We consider semantic characterizations of definability, as…
We prove a Structure Identity Principle for theories defined on types of $h$-level 3 by defining a general notion of saturation for a large class of structures definable in the Univalent Foundations.
The paper is in essence a survey of categories having $\phi$-weighted colimits for all the weights $\phi$ in some class $\Phi$. We introduce the class $\Phi^+$ of {\em $\Phi$-flat} weights which are those $\psi$ for which $\psi$-colimits…
If M is a nonstandard model of Peano Arithmetic, then M is lofty iff M has a simple elementary extension that is recursively saturated. This had previously been known for countable M.
A topological space $X$ is Baire if the intersection of any sequence of open dense subsets of $X$ is dense in $X$. Let $C_p(X,[0,1])$ denote the space of all continuous $[0,1]$-valued functions on a Tychonoff space $X$ with the topology of…
Let M be a paracompact differentiable manifold, A a local algebra and M^{A} a manifold of infinitely near points on M of kind A. We define the notion of A-Poisson manifold on M^{A}. We show that when M is a Poisson manifold, then M^{A} is…
The m-sophistication of a finite binary string x is introduced as a generalization of some parameter in the proof that complexity of complexity is rare. A probabilistic near sufficient statistic of x is given which length is upper bounded…
We start by giving a survey to the theory of Borel*(\kappa) sets in the generalized Baire space Baire({\kappa}) = {\kappa}^{\kappa}. In particular we look at the relation of this complexity class to other complexity classes which we denote…
The Bodirsky-Pinsker conjecture asserts a P vs. NP-complete dichotomy for the computational complexity of Constraint Satisfaction Problems (CSPs) of first-order reducts of finitely bounded homogeneous structures. Prominently, two structures…
We define a class of Separation Logic formulae, whose entailment problem: given formulae $\phi, \psi_1, \ldots, \psi_n$, is every model of $\phi$ a model of some $\psi_i$? is 2EXPTIME-complete. The formulae in this class are existentially…
We prove that many properties and invariants of definable groups in NIP theories, such as definable amenability, G/G^{00}, etc., are preserved when passing to the theory of the Shelah expansion by externally definable sets, M^{ext}, of a…
By [R. Bautista, P. Gabriel, A.V Roiter., L. Salmeron, Representation-finite algebras and multiplicative basis. Invent. Math. 81 (1985) 217-285.], a finite-dimensional algebra having finitely many isoclasses of indecomposable…