Related papers: Forking and superstability in tame AECs
We introduce a generalized notion of finiteness that provides a structural principle for the set of effective theories that can be consistently coupled to quantum gravity. More concretely, we propose a Tameness Conjecture that states that…
We show that the theory of a non-degenerate representation of a C*-algebra A over a Hilbert space H is superstable. Also, we characterize forking, orthogonality and domination of types and show that the theory has weak elimination of…
Foreman proved the Duality Theorem, which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of $\omega_1$ is preserved by any proper forcing. We…
The Gap Forcing Theorem, a key contribution of this paper, implies essentially that after any reverse Easton iteration of closed forcing, such as the Laver preparation, every supercompactness measure on a supercompact cardinal extends a…
Motivated by the behavior of the trace pairing over tame cyclic number fields, we introduce the notion of tame lattices. Given an arbitrary non-trivial lattice $\mathcal{L}$ we construct a parametric family of full-rank sub-lattices…
Mathematicians still use Naive Set Theory when generating sets without danger of producing any contradiction. Therefore their working method can be considered as a consistent inference system with an experience of over 100 years. My…
In the original version of this paper, we assume a theory $T$ that the logic $\mathbb L_{\kappa, \aleph_{0}}$ is categorical in a cardinal $\lambda > \kappa$, and $\kappa$ is a measurable cardinal. There we prove that the class of model of…
The category of models of any theory $T$ in any first-order language $L$ has the surprising property that any small category that is elementarily equivalent with it, already embeds in it. The proof uses an abstract argument via ultrapowers,…
In this article we proved so-called strong reflection principles corresponding to formal theories Th which has omega-models. An posible generalization of the Lob's theorem is considered.Main results is: (1) let $k$ be an inaccessible…
Monadic stability and the more general monadic dependence (or NIP) are tameness conditions for classes of logical structures, studied in the 80's in Shelah's classification program in model theory. They recently emerged in algorithmic and…
Assuming the existence of a monster model, tameness and continuity of nonsplitting in an abstract elementary class (AEC), we extend known superstability results: let $\mu>LS({\bf K})$ be a regular stability cardinal and let $\chi$ be the…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
We provide comprehensive, level-by-level characterizations of large cardinals, in the range from weakly compact to strongly compact, by closure properties of powerful images of accessible functors. In the process, we show that these…
We continue our work on the model theory of free lattices, solving two of the main open problems from our first paper on the subject. Our main result is that the universal (existential) theory of infinite free lattices is decidable. Our…
We explore classifiability of crossed products of actions of countable amenable groups on compact, metrizable spaces. It is completely understood when such crossed products are simple, separable, unital, nuclear and satisfy the UCT: these…
We prove two results about generically stable types $p$ in arbitrary theories. The first, on existence of strong germs, generalizes results from D. Haskell, E. Hrushovski and D. Macpherson on stably dominated types. The second is an…
The primary goal of this paper is to establish a model of $ZFC$ wherein the definable tree property is affirmed for all uncountable regular cardinals. This endeavor commences with the utilization of both a supercompact cardinal and a…
We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic filters. We formalize the definition of forcing notions as…
We give an elementary description of $2$-categories $\mathbf{Cat}\left(\mathcal{E}\right)$ of internal categories, functors and natural transformations, where $\mathcal{E}$ is a category modelling Lawvere's elementary theory of the category…
We derive norm bounds that imply the convergence of perturbation theory in fermionic quantum field theory if the propagator is summable and has a finite Gram constant. These bounds are sufficient for an application in renormalization group…