Related papers: Structural submodularity and tangles in abstract s…
Let M be ternary, homogeneous and simple. We prove that if M is finitely constrained, then it is supersimple with finite SU-rank and dependence is $k$-trivial for some $k < \omega$ and for finite sets of real elements. Now suppose that, in…
We generalise various theorems for finding indiscernible trees and arrays to positive logic: based on an existing modelling theorem for s-trees, we prove modelling theorems for str-trees, str$_0$-trees (the reduct of str-trees that forgets…
We extend Makkai duality between coherent toposes and ultracategories to a duality between toposes with enough points and ultraconvergence spaces. Our proof generalizes and simplifies Makkai's original proof. Our main result can also be…
We prove that mu = mu^{< mu}, 2^mu = mu^+ and ``there is a non reflecting stationary subset of mu^+ composed of ordinals of cofinality < mu'' imply that there is a mu-complete Souslin tree on mu^+ .
We show that first-order logic can be translated into a very simple and weak logic, and thus set theory can be formalized in this weak logic. This weak logical system is equivalent to the equational theory of Boolean algebras with three…
A tree $T$ on $2^n$ vertices is called set-sequential if the elements in $V(T)\cup E(T)$ can be labeled with distinct nonzero $(n+1)$-dimensional $01$-vectors such that the vector labeling each edge is the component-wise sum modulo $2$ of…
Let V be a simple vertex operator algebra satisfying the following conditions: (i) The homogeneous subspaces of V of weights less than 0 are 0, the homogeneous subspace of V of weight 0 is spanned by the vacuum and V' is isomorphic to V as…
For sufficiently nice families of semigroups and monoids, the structure theorem for sets of length states that the length set of any sufficiently large element is an arithmetic sequence with some values omitted near the ends. In this paper,…
This short paper presents a generalisation of Tressl's structure theorem for differentially finitely generated algebras over differential rings of characteristic 0 to the case of separable algebras over differential rings of arbitrary…
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…
Real algebra is usually thought of as the study of certain kinds of preorders on fields and rings. Among its core themes are the separation theorems known as Positivstellens\"atze. However, there is a nascent subfield of real algebra which…
In Chapter 3 of his Notes on constructive mathematics, Martin-L{\"o}f describes recursively constructed ordinals. He gives a constructively acceptable version of Kleene's computable ordinals. In fact, the Turing definition of computable…
We are concerned with two separation theorems about analytic sets by Dyck and Preiss, the former involves the positively-defined subsets of the Cantor space and the latter the Borel-convex subsets of finite dimensional Banach spaces. We…
It is known by results of Dyckerhoff-Kapranov and of G\'alvez--Carrillo-Kock-Tonks that the output of the Waldhausen S.-construction has a unital 2-Segal structure. Here, we prove that a certain S.-functor defines an equivalence between the…
This paper is about the orbifold theory for vertex operator superalgebras. Given a vertex operator superalgebra V and a finite automorphism group G of V, we show that the trace functions associated to the twisted sectors are holomorphic in…
We describe the construction of the genus-zero parts of conformal field theories in the sense of G. Segal from representations of vertex operator algebras satisfying certain conditions. The construction is divided into four steps and each…
In this paper, a Gaifman-Shapiro-style module architecture is tailored to the case of Smodels programs under the stable model semantics. The composition of Smodels program modules is suitably limited by module conditions which ensure the…
Ordered, linear, and other substructural type systems allow us to expose deep properties of programs at the syntactic level of types. In this paper, we develop a family of unary logical relations that allow us to prove consequences of…
String theory appears to admit a group of discrete field transformations -- called $S$ dualities -- as exact non-perturbative quantum symmetries. Mathematically, they are rather analogous to the better-known $T$ duality symmetries, which…
In this paper we give an algorithm to determine, for any given suborder closed class of series-parallel posets, a structure theorem for the class. We refer to these structure theorems as structural descriptions.