Related papers: Tameness from two successive good frames
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
This paper explores the consistency strength of The Proper Forcing Axiom ($\textsf{PFA}$) and the theory (T) which involves a variation of the Viale-Wei$\ss$ guessing hull principle. We show that (T) is consistent relative to a supercompact…
If kappa is strongly compact, lambda > kappa is regular, then (2^{< lambda})^+ --> (lambda+eta)^2_theta holds for eta,theta<kappa.
For an $\aleph_1$-categorical atomic class, we clarify the space of types over the unique model of size $\aleph_1$. Using these results, we prove that if such a class has a model of size $\beth_1^+$ then it is $\omega$-stable.
A class K of structures is controlled if, for all cardinals lambda, the relation of L_{infty,lambda}-equivalence partitions K into a set of equivalence classes (as opposed to a proper class). We prove that the class of doubly transitive…
We develop a general theory for class-sized symmetric systems as a natural extension of symmetric systems with respect to class forcing. In particular, adapting the usual notions of pretameness and tameness for class forcing, we present…
Shelah has provided sufficient conditions for an $L_{\omega_1, \omega}$-sentence $\psi$ to have arbitrarily large models and for a Morley-like theorem to hold of $\psi$. These conditions involve structural and set-theoretic assumptions on…
Classification theory of elementary classes deals with first order (elementary) classes of structures (i.e. fixing a set T of first order sentences, we investigate the class of models of T with the elementary submodel notion). It tries to…
A model M of cardinality lambda is said to have the small index property if for every G subseteq Aut(M) such that [Aut(M):G] <= lambda there is an A subseteq M with |A|< lambda such that Aut_A(M) subseteq G. We show that if M^* is a…
The calculus of Dependent Object Types (DOT) has enabled a more principled and robust implementation of Scala, but its support for type-level computation has proven insufficient. As a remedy, we propose $F^\omega_{..}$, a rigorous…
In this paper, we study a stability transfer theorem in d-tame Metric Abstract Elementary classes, in a similar way as in [BaKuVa], but using superstability-like assumptions which involves a new independence notion (Tame Independence)…
For a tensor triangulated category and any regular cardinal $\alpha$ we study the frame of $\alpha$-localizing tensor ideals and its associated space of points. For a well-generated category and its frame of localizing tensor ideals we…
This is the second in a series of articles developing abstract classification theory for classes that have a notion of prime models over independent pairs and over chains. It deals with the problem of smoothness and establishing the…
We work in a first-order setting where structures are spread out over a metric space, with quantification allowed only over bounded subsets. Assuming a doubling property for the metric space, we define a canonical {\em core} $\mathcal{J}$…
We extend the classical notion of standardly stratified $k$-algebra (stated for finite dimensional $k$-algebras) to the more general class of rings, possibly without $1,$ with enough idempotents. We show that many of the fundamental…
We apply the notion of a full convex subcategory to a wide range of algebras including tilted, quasi-tilted, shod, weakly shod, left and right glued, laura, simply connected, strongly simply connected, left supported, and cluster-tilted. In…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
This is a slightly corrected version of an old work. Under certain cardinal arithmetic assumptions, we prove that for every large enough regular $\lambda$ cardinal, for many regular $\kappa < \lambda$, many stationary subsets of $\lambda$…
We show that if the weak compactness of a cardinal is made indestructible by means of any preparatory forcing of a certain general type, including any forcing naively resembling the Laver preparation, then the cardinal was originally…
In this article we prove three main theorems: (1) guessing models are internally unbounded, (2) for any regular cardinal $\kappa \ge \omega_2$, $\textsf{ISP}(\kappa)$ implies that $\textsf{SCH}$ holds above $\kappa$, and (3) forcing posets…