Related papers: Exact saturation in pseudo-elementary classes for …
Saturation is (mu,kappa)-transferable in T if and only if there is an expansion T_1 of T with |T_1| = |T| such that if M is a mu-saturated model of T_1 and |M| \geq kappa then the reduct M|L(T) is kappa-saturated. We characterize theories…
A discrete countable group G is matricially stable if the finite dimensional approximate unitary representations of G are perturbable to genuine representations in the point-norm topology. For large classes of groups G, we show that…
We define a weak iterability notion that is sufficient for a number of arguments concerning $\Sigma_1$-definability at uncountable regular cardinals. In particular we give its exact consistency strength firstly in terms of the second…
We prove that in a countable theory $T$ fully stable over a predicate $P$, any $\lam$-complete set $A$ has the $\lam$-existence property. This means that $A$ can be extended to a $\lam$-saturated model of $T$ without changing the $P$-part.…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
Drawing on the theory of Minimal Model Program singularities for foliations, we define relative canonical and log-canonical singularities for algebraic stacks with finite generic stabilisers. We show that if a point has log-canonical…
We show (in ZFC) that the cardinality of a compact homogeneous space of countable tightness is no more than the size of the continuum.
In this paper we study local stable/unstable sets of sensitive homeomorphisms with the shadowing property defined on compact metric spaces. We prove that local stable/unstable sets always contain a compact and perfect subset of the space.…
We consider the problem of deciding the satisfiability of quantifier-free formulas in the theory of finite sets with cardinality constraints. Sets are a common high-level data structure used in programming; thus, such a theory is useful for…
We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…
We give necessary and sufficient geometric conditions for a theory definable in an o-minimal structure to interpret a real closed field. The proof goes through an analysis of thorn-minimal types in super-rosy dependent theories of finite…
We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…
Good frames were suggested in [Sh:h] as the (bare-bones) parallel, in the context of AECs, to superstable (among elementary classes). Here we consider $(\mu,\lambda,\kappa)$-frames as candidates for being (in the context of AECs) the…
The two-dimensional case occupies a special position in the theory of critical phenomena due to the exact results provided by lattice solutions and, directly in the continuum, by the infinite-dimensional character of the conformal algebra.…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…
Typestate systems ensure many desirable properties of imperative programs, including initialization of object fields and correct use of stateful library interfaces. Abstract sets with cardinality constraints naturally generalize typestate…
We obtain a characterization of left perfect rings via superstability of the class of flat left modules with pure embeddings. $\mathbf{Theorem.}$ For a ring $R$ the following are equivalent. - $R$ is left perfect. - The class of flat left…
Automated theorem provers (ATPs) can disprove conjectures by saturating a set of clauses, but the resulting saturated sets are opaque certificates. In the unit equational fragment, a saturated set can in fact be read as a convergent rewrite…
We study the saturation properties of several classes of $C^*$-algebras. Saturation has been shown by Farah and Hart to unify the proofs of several properties of coronas of $\sigma$-unital $C^*$-algebras; we extend their results by showing…
In the context of abstract elementary classes (AECs) with a monster model, several possible definitions of superstability have appeared in the literature. Among them are no long splitting chains, uniqueness of limit models, and solvability.…