Related papers: Abstract Corrected Iterations

Measuring says that for e\-very sequence $(C_\delta)_{\delta<\omega_1}$ with each $C_\delta$ being a closed subset of $\delta$ there is a club $C\subseteq\omega_1$ such that for every $\delta\in C$, a tail of $C\cap\delta$ is either…

We use coherent systems of FS iterations on a power set, which can be seen as matrix iteration that allows restriction on arbitrary subsets of the vertical component, to prove general theorems about preservation of certain type of unbounded…

We prove two general results about the preservation of extendible and $C^{(n)}$-extendible cardinals under a wide class of forcing iterations (Theorems 5.4 and 7.5). As applications we give new proofs of the preservation of Vop\v{e}nka's…

We show how to force, with finite conditions, the forcing axiom PFA(T), a relativization of PFA to proper forcing notions preserving a given Souslin tree T. The proof uses a Neeman style iteration with generalized side conditions consisting…

We show that satisfiability for CTL* with equality-, order-, and modulo-constraints over Z is decidable. Previously, decidability was only known for certain fragments of CTL*, e.g., the existential and positive fragments and EF.

The research on gradual typing has led to many variations on the Gradually Typed Lambda Calculus (GTLC) of Siek and Taha (2006) and its underlying cast calculus. For example, Wadler and Findler (2009) added blame tracking, Siek et al.…

We isolate the limit-stage filter construction needed for countable-support symmetric iterations built from standard successor-step symmetric systems. At successor stages we take the $\omega_1$-completion of the usual successor-stage…

The purpose of this article is to prove that the forcing axiom for completely proper forcings is inconsistent with the Continuum Hypothesis. This answers a longstanding problem of Shelah. The corresponding completely proper forcing which…

We present code constructions for masking $u$ partially stuck memory cells with $q$ levels and correcting additional random errors. The results are achieved by combining the methods for masking and error correction for stuck cells in [1]…

Full-sampling (e.g., Q-learning) and pure-expectation (e.g., Expected Sarsa) algorithms are efficient and frequently used techniques in reinforcement learning. Q$(\sigma,\lambda)$ is the first approach unifies them with eligibility trace…

Correctness of program transformations in extended lambda calculi with a contextual semantics is usually based on reasoning about the operational semantics which is a rewrite semantics. A successful approach to proving correctness is the…

We present a method to iterate finitely splitting lim-sup tree forcings along non-wellfounded linear orders. We apply this method to construct a forcing (without using an inaccessible or amalgamation) that makes all definable sets of reals…

We introduce a new class of ultrafilters which generalizes the well-known class of simple $P$-point ultrafilters. We prove that for any well-founded $\sigma$-directed partial order $\mathbb{D}$ there is a mild forcing extension where there…

Using a theorem from pcf theory, we show that for any singular cardinal nu, the product of the Cohen forcing notions on kappa, kappa < nu adds a generic for the Cohen forcing notion on nu^+. This solves Problem 5.1 in Miller's list…

This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…

A sequence-to-sequence learning with neural networks has empirically proven to be an effective framework for Chinese Spelling Correction (CSC), which takes a sentence with some spelling errors as input and outputs the corrected one.…

We present preservation theorems for countable support iteration of nep forcing notions satisfying ``old reals are not Lebesgue null'' and ``old reals are not meager''. (Nep is a generalization of Suslin proper.) We also give some results…

We show that higher Sacks forcing at a regular limit cardinal and club Miller forcing at an uncountable regular cardinal both add a diamond sequence. We answer the longstanding question, whether $\kappa = \kappa^{<\kappa} \geq\aleph_1$…

We develop the theory of the forcing with trees and creatures for an inaccessible lambda continuing Ros{\l}anowski and Shelah math.LO/9807172, math.LO/9909115. To make a real use of these forcing notions (that is to iterate them without…

Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields are studied. An algorithm for factorizing $x^n-\lambda$ over $\mathbb{F}_{q^2}$ is given, where $\lambda$ is a unit in $\mathbb{F}_{q^2}$. Based on this…