Related papers: A version of the Jensen-Johnsbr{\aa}ten coding at …

It was established by Jensen in 1970 that there is a generic extension $L[a]$ of the constructible universe $L$ by a real $a\not\in L$ such that $a$ is $\varDelta^1_3$ in $L[a]$. Jensen's forcing construction has found a number of…

Assuming that there is no inner model with a strong cardinal, the following is shown: any subset of \omega_1 can be made \Delta^1_3 (in the codes) by a reasonable set-forcing; there is a reasonable set-generic extension with a \Delta^1_3…

A set $G \subseteq \omega$ is $n$-generic for a positive integer $n$ if and only if every $\Sigma^0_n$ formula of $G$ is decided by a finite initial segment of $G$ in the sense of Cohen forcing. It is shown here that every $n$-generic set…

In this paper, we prove the following: If $n\ge3$, there is a generic extension of $L$ -- the constructible universe -- in which it is true that the Separation principle holds for both effective (lightface) classes $\varSigma^1_n$ and…

A code $C \subseteq \F_2^n$ is a $(c,\epsilon,\delta)$-expander code if it has a Tanner graph, where every variable node has degree $c$, and every subset of variable nodes $L_0$ such that $|L_0|\leq \delta n$ has at least $\epsilon c |L_0|$…

It is shown, under the assumption of Jensen's principle $\lozenge$, that if for a complex L with $[L] \geq [S^{4}]$ there exists a metrizable compactum whose extension dimension is L, then there exists a differentiable, countably compact,…

Wang, Jiang and Cao have obtained a generalized version of the J\o{}rgensen inequality in Proc. Indian Acad. Sci. Math. Sci., 123(2):245--251, 2013, for two generator subgroups of ${\rm SL}(2, \mathbb C)$ where one of the generators is…

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…

We study central extensions of the Lie superalgebra $sl_{m|n}(A)$, where $A$ is a $Z/2Z$-graded superalgebra over a commutative ring $K$. The Steinberg Lie superalgebra $st_{m|n}(A)$ plays a crucial role. We show that $st_{m|n}(A)$ is a…

Let $M$ be a transitive model of $ZFC$ and let ${\bf B}$ be a $M$-complete Boolean algebra in $M.$ (In general a proper class.) We define a generalized notion of forcing with such Boolean algebras, $^*$forcing. (A $^*$ forcing extension of…

We make use of generalized iterations of Jensen forcing to define a cardinal-preserving generic model of ZF for any $n\ge 1$ and each of the following four Choice hypotheses: (1)…

Henle, Mathias, and Woodin proved that, provided that $\omega\rightarrow(\omega)^{\omega}$ holds in a model $M$ of ZF, then forcing with $([\omega]^{\omega},\subseteq^*)$ over $M$ adds no new sets of ordinals, thus earning the name a…

We show that if $M$ is a countable transitive model of ZF and if $a,b$ are reals not in $M$, then there is a $G$ generic over $M$ such that $b \in L[a,G]$. We then present several applications such as the following: if $J$ is any countable…

In this paper we prove a version of Lie-B\"acklund theorem for overdetermined systems of scalar PDEs, whose general solution depends on 1 function of 1 variable. This generalizes the case of involutive system of the second order on the…

Using a variation of Woodin's $\mathbb{P}_{\mathrm{max}}$ forcing, we force over a model of the Axiom of Determinacy to produce a model of ZFC containing a very strongly increasing sequence of length $\omega_{2}$ consisting of functions…

We consider the generalized Anderson Model $\Delta+\sum_{n\in\mathcal{N}}\omega_n P_n$, where $\mathcal{N}$ is a countable set, $\{\omega_n\}_{n\in\mathcal{N}}$ are i.i.d random variables and $P_n$ are rank $N<\infty$ projections. For these…

This is a follow up to a paper by the author where the disjointness relation for (the graphs of) definable functions from ${^\omega \omega}$ to ${^\omega \omega}$ is analyzed. In that paper, for each $a \in {^\omega \omega}$ we defined a…

Posner and Robinson (1981) proved that if $S \subseteq \omega$ is non-computable, then there exists a $G \subseteq \omega$ such that $S \oplus G \geq_T G'$. Shore and Slaman (1999) extended this result to all $n \in \omega$, by showing that…

For a given length and a given degree and an arbitrary partition of the positive integers, there always is a cell containing a polynomial progression of that length and that degree; moreover, the coefficients of the generating polynomial…

For each $\Delta>0$, we prove that there exists some $C=C(\Delta)$ for which the binomial random graph $G(n,C\log n/n)$ almost surely contains a copy of every tree with $n$ vertices and maximum degree at most $\Delta$. In doing so, we…