Related papers: Forcing With Copies of Countable Ordinals

We present a method of computing the generating function $f_P(\x)$ of $P$-partitions of a poset $P$. The idea is to introduce two kinds of transformations on posets and compute $f_P(\x)$ by recursively applying these transformations. As an…

We describe a novel analogue algorithm that allows the simultaneous factorization of an exponential number of large integers with a polynomial number of experimental runs. It is the interference-induced periodicity of "factoring"…

We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…

We introduce a Combinatorial Hopf Algebra (CHA) with bases indexed by the partition diagrams indexing the bases for partition algebras. By analogy with the operation $H_{\alpha} H_{\beta} = H_{\alpha \cdot \beta}$ for the complete…

Suppose that $P$ is a forcing notion, $L$ is a language (in $V$), $\dot{\tau}$ a $P$-name such that $P\Vdash$ "$\dot{\tau}$ is a countable $L$-structure". In the product $P\times P$, there are names $\dot{\tau_{1}},\dot{\tau_{2}}$ such that…

$\mathop{\rm rp}\nolimits ({\mathbb B})$ denotes the reduced power ${\mathbb B}^\omega /\Phi$ of a Boolean algebra ${\mathbb B}$, where $\Phi$ is the Fr\'{e}chet filter $\Phi$ on $\omega$. We investigate iterated reduced powers…

Let $Z_3$ denote $3^{rd}$ order arithmetic. Let Harrington's Principle, HP, denote the statement that there is a real $x$ such that every $x$--admissible ordinal is a cardinal in $L$. In this paper, assuming there exists a remarkable…

Let \(\mathcal{P}(n)\) be the set of partitions of the positive integer \(n\). For \(\alpha=(\alpha_1,...,\alpha_t) \in \mathcal{P}(n)\) define the diagonal sequence \(\delta(\alpha)=(d_k(\alpha))_{k \geq 1}\) via \( d_k(\alpha) =…

We introduce bounded category forcing axioms for well-behaved classes $\Gamma$. These are strong forms of bounded forcing axioms which completely decide the theory of some initial segment of the universe $H_{\lambda_\Gamma^+}$ modulo…

We present a method which forces the failure of $\Pi^1_3$ and $\Sigma^1_3$-separation, while $\mathsf{MA} (\mathcal{I}$) holds, for $\mathcal{I}$ the family of indestructible ccc forcings. This shows that, in contrast to the assumption…

We show that in a model obtained by forcing with a countable support iteration of length omega_2 of Mathias forcing h(2), the distributivity number of r.o.(P(omega)/fin)^2, is omega_1 but h, the one of P(omega)/fin, is omega_2.

In Part I of this series, we introduced a class of notions of forcing which we call Sigma-Prikry, and showed that many of the known Prikry-type notions of forcing that center around singular cardinals of countable cofinality are…

We present a version with non-definable forcing notions of Shelah's theory of iterated forcing along a template. Our main result, as an application, is that, if $\kappa$ is a measurable cardinal and $\theta<\kappa<\mu<\lambda$ are…

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

We investigate the distribution of $\alpha p$ modulo one in imaginary quadratic number fields $\mathbb{K}\subset\mathbb{C}$ with class number one, where $p$ is restricted to prime elements in the ring of integers $\mathcal{O} =…

Given a finite group $G$, we denote by $\psi\,'(G)$ the product of element orders of $G$. Our main result proves that the restriction of $\psi\,'$ to abelian $p$-groups of order $p^n$ is strictly increasing with respect to a natural order…

We give an alternative presentation of the ordinal notation at the strength of $\Pi^1_1-CA_0$ which allows the "uncountable" notation $\Omega$ to be interpreted "polymorphically" - that is, we allow the notation to be interpreted as…

A copula of continuous random variables $X$ and $Y$ is called an \emph{implicit dependence copula} if there exist functions $\alpha$ and $\beta$ such that $\alpha(X) = \beta(Y)$ almost surely, which is equivalent to $C$ being factorizable…

A classical theorem of Hechler asserts that the structure $\left(\omega^\omega,\le^*\right)$ is universal in the sense that for any $\sigma$-directed poset P with no maximal element, there is a ccc forcing extension in which…