Related papers: Of Mice and Machetes
We characterize sums of normal ultrafilters after the Magidor iteration (product) of Prikry forcings over a discrete set of measurable cardinals. We apply this to show that the weak Ultrapower Axiom is not equivalent to the Ultrapower…
We study the question, what computational power is sufficient to perform constructions using either Laver or Hechler forcing. As a result, we obtain a separation between three relativised non-lowness classes that are the…
We introduce a forcing that adds a $\square(\aleph_2,\aleph_0)$-sequence with countable conditions under CH. Assuming the consistency of a weakly compact cardinal, we can find a forcing extension by our new poset in which both…
In this paper we show how to build a model of $ZFC$ such that all its inner models satisfying the Axiom of Choice are well-ordered with respect to inclusion, and that said ordering is of arbitrary height (including possibly $Ord$ high). We…
The study of inner models was initiated by G\"odel's analysis of the constructible universe. Later, the study of canonical inner models with large cardinals, e.g., measurable cardinals, strong cardinals or Woodin cardinals, was pioneered by…
We define a class of inverse monoids having the property that their lattices of principal ideals naturally form an MV-algebra. We say that an arbitrary MV-algebra can be co-ordinatized if it is isomorphic to one constructed in this way from…
The purpose of this paper is to give a simpler proof to the problem of controllability of a Hilbert snake \cite{PeSa}. Using the action of the M\"obius group of the unit sphere on the configuration space, in the context of a separable…
We give a self-contained introduction to accessible categories and how they shed light on both model- and set-theoretic questions. We survey for example recent developments on the study of presentability ranks, a notion of cardinality…
Alas, Junqueira and Wilson asked whether there is a discretely generated locally compact space whose one point compactification is not discretely generated and gave a consistent example using CH. Their construction uses a remote filter in…
We investigate accessible subgroups of a profinite group $G$, i.e. subgroups $H$ appearing as vertex groups in a graph of profinite groups decomposition of $G$ with finite edge groups. We prove that any accessible subgroup $H \leq G$ arises…
Given a finite lattice $L$ that can be embedded in the recursively enumerable (r.e.) Turing degrees $\mathcal{R}_{\mathrm{T}}$, it is not known how one can characterize the degrees $\mathbf{d}\in\mathcal{R}_{\mathrm{T}}$ below which $L$ can…
We present two ways in which the model $L({\mathbb R})$ is canonical assuming the existence of large cardinals. We show that the theory of this model, with {\em ordinal} parameters, cannot be changed by small forcing; we show further that a…
Let lambda be an infinite cardinal number and let C = {H_i| i in I} be a family of nontrivial groups. Assume that |I|<=lambda, |H_i|<= lambda, for i in I, and at least one member of C achieves the cardinality lambda. We show that there…
For exponentially closed ordinals $\alpha$, we consider recognizability of constructible subsets of $\alpha$ for $\alpha$-(w)ITRMs and their distribution in the constructible hierarchy. In particular, for $\alpha$-ITRMs, we show that, there…
We introduce a new inner model $C(aa)$ arising from stationary logic. We show that assuming a proper class of Woodin cardinals, or alternatively $MM^{++}$, the regular uncountable cardinals of $V$ are measurable in the inner model $C(aa)$,…
In this article we introduce and study hyperclass-forcing (where the conditions of the forcing notion are themselves classes) in the context of an extension of Morse-Kelley class theory, called MK$^{**}$. We define this forcing by using a…
Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…
Given a class of groups C, a group G is strongly accessible over C if there is a bound on the number of terms in a sequence L(1), L(2), ..., L(n) of graph of groups decompositions of G with edge groups in C such that L(1) is the trivial…
We analyze the notion of guessing model, a way to assign combinatorial properties to arbitrary regular cardinals. Guessing models can be used, in combination with inaccessibility, to characterize various large cardinals axioms, ranging from…
We present a novel, perspicuous framework for building iterated ultrapowers. Furthermore, our framework naturally lends itself to the construction of a certain type of order indiscernibles, here dubbed tight indiscernibles, which are shown…