Related papers: Small models, large cardinals, and induced ideals
Assuming that there is no inner model with a Woodin cardinal, we obtain a characterization of $\lambda$-tall cardinals in extender models that are iterable. In particular we prove that in such extender models, a cardinal $\kappa$ is a tall…
Generalising slightly the notions of a strict computability model and of a simulation between them, which were elaborated by Longley and Normann, we define canonical computability models over categories and appropriate Set-valued functors…
It is shown how regular model sets can be characterized in terms of regularity properties of their associated dynamical systems. The proof proceeds in two steps. First, we characterize regular model sets in terms of a certain map $\beta$…
Multi-class systems having possibly both finite and infinite classes are investigated under a natural partial exchangeability assumption. It is proved that the conditional law of such a system, given the vector of the empirical measures of…
We introduce reflection properties of cardinals in which the attributes that reflect are expressible by infinitary formulas whose lengths can be strictly larger than the cardinal under consideration. This kind of generalized reflection…
We study properties that allow first-order theories to be disjointly combined, including stable infiniteness, shininess, strong politeness, and gentleness. Specifically, we describe a Galois connection between sets of decidable theories,…
In this paper using the notion of an ideal I on a directed set, we extend the notion of convergence of nets of partial maps to the notions of I-convergence ( or filter convergence) of nets of partial maps and I*- convergence of nets of…
We like to develop model theory for $T$, a complete theory in $\mathbb{L}_{\theta,\theta}(\tau)$ when $\theta$ is a compact cardinal. By [Sh:300a] we have bare bones stability and it seemed we can go no further. Dealing with ultrapowers…
Under large cardinal hypotheses beyond the Kunen inconsistency -- hypotheses so strong as to contradict the Axiom of Choice -- we solve several variants of the generalized continuum problem and identify structural features of the levels…
We generalize the measurement using an expanded concept of cover, in order to provide a new approach to size of set other than cardinality. The generalized measurement has application backgrounds such as a generalized problem in dimension…
The tower number $\mathfrak t$ and the ultrafilter number $\mathfrak u$ are cardinal characteristics from set theory. They are based on combinatorial properties of classes of subsets of~$\omega$ and the almost inclusion relation…
We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…
Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…
Interpretable predictions, where it is clear why a machine learning model has made a particular decision, can compromise privacy by revealing the characteristics of individual data points. This raises the central question addressed in this…
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…
Higher order set theory has been a topic of interest for some time, with recent efforts focused on the strength of second order set theories [KW16]. In this paper we strive to present one 'theory of collections' that allows for a formal…
Detecting and exploiting similarities between seemingly distant objects is without doubt an important human ability. This paper develops \textit{from the ground up} an abstract algebraic and qualitative notion of similarity based on the…
We characterize the orderings of pairs of sets induced by several distances: Hamming, Jaccard, S\o rensen-Dice and Overlap. We also characterize these distances.
We try to control many cardinal characteristics by working with a notion of orthogonality between two families of forcings. We show that b^+<g is consistent
We study closure properties of measurable ultrapowers with respect to Hamkin's notion of "freshness" and show that the extent of these properties highly depends on the combinatorial properties of the underlying model of set theory. In one…