Related papers: Accessible images revisited
For a category $\mathbb{C}$, a small category $\mathbb{I}$, and a pre-cover relation $\sqsubset$ on $\mathbb C$ we prove, under certain completeness assumptions on $\mathbb C$, that a morphism $g: B\to C$ in the functor category $\mathbb…
We give a detailed proof of the properties of the usual Prikry type forcing notion for turning a measurable cardinal into $\aleph_\omega$.
The work presents the second part of the second edition of its previous one published in 2000 under the same title, containing the proof (in ZF) of the inaccessible cardinals nonexistence, which is enriched and improved now. This part…
We introduce the notion of a critical cardinal as the critical point of sufficiently strong elementary embedding between transitive sets. Assuming the axiom of choice this is equivalent to measurability, but it is well-known that choice is…
We show that in a locally lambda-presentable category, every lambda(m)-injectivity class (i.e., the class of all the objects injective with respect to some class of lambda-presentable morphisms) is a weakly reflective subcategory determined…
We show that supercompactness and strong compactness can be equivalent even as properties of pairs of regular cardinals. Specifically, we show that if V models ZFC + GCH is a given model (which in interesting cases contains instances of…
We show that many large cardinal notions up to measurability can be characterized through the existence of certain filters for small models of set theory. This correspondence will allow us to obtain a canonical way in which to assign ideals…
Shelah showed that the existence of free subsets over internally approachable subalgebras follows from the failure of the PCF conjecture on intervals of regular cardinals. We show that a stronger property called the Approachable Bounded…
We prove that $i)$ if $\mathcal{A}$ is $\lambda $-accessible and it is axiomatizable in (finitary) coherent logic then $\lambda $-pure maps are strict monomorphisms and $ii)$ if there is a proper class of strongly compact cardinals and…
Problem 5.1 in page 181 of [Fuc15] asks to find the cardinals $\lambda$ such that there is a universal abelian $p$-group for purity of cardinality $\lambda$, i.e., an abelian $p$-group $U_\lambda$ of cardinality $\lambda$ such that every…
We prove that a weak factorization system on a locally presentable category is accessible if and only if it is small generated in the sense of R. Garner. Moreover, we discuss an analogy of Smith's theorem for accessible model categories.
We give a purely category-theoretic proof of the result of Makkai and Par\'e saying that the category $\bf Lin$ of linearly ordered sets and order preserving injective mappings is a minimal finitely accessible category. We also discuss the…
We show that Weak Vop\v{e}nka's Principle, which is the statement that the opposite category of ordinals cannot be fully embedded into the category of graphs, is equivalent to the large cardinal principle Ord is Woodin, which says that for…
Our results in this paper increase the model-theoretic precision of a widely used method for building ultrafilters, and so advance the general problem of constructing ultrafilters whose ultrapowers have a precise degree of saturation. We…
We show that it is consistent relative to a weakly compact cardinal that strong homology is additive and compactly supported within the class of locally compact separable metric spaces. This complements work of Marde\v{s}i\'{c} and Prasolov…
We show that many large cardinal notions can be characterized in terms of the existence of certain elementary embeddings between transitive set-sized structures, that map their critical point to the large cardinal in question. In…
In the first part of this paper, we explore the possibility for a very large cardinal $\kappa$ to carry a $\kappa$-complete ultrafilter without Galvin's property. In this context, we prove the consistency of every ground model…
Let $\kappa$ be any regular cardinal. Assuming the existence of a huge cardinal above $\kappa$, we prove the consistency of $\binom{\kappa^{++}}{\kappa^+}\rightarrow\binom{\tau}{\kappa^+}$ for every ordinal $\tau<\kappa^{++}$. Likewise, we…
It is proved to be consistent relative to a measurable cardinal that there is a uniform ultrafilter on the real numbers which is generated by fewer than the maximum possible number of sets. It is also shown to be consistent relative to a…
The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…