Related papers: Iterated club shooting and the stationary-logic co…
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)$,…
We answer a question of Moore by building a forcing extension satisfying measuring together with CH. The construction works over any model of ZFC and can be described as a forcing iteration with countable structures as side conditions and…
We give an exposition of an iteration theorem for iterating $(<\lambda)$-closed stationary $\lambda^+$-cc forcing with supports of size $<\lambda$ and preserving these two properties. We discuss the relation of this theorem with other…
We give the optimal conditions for the existence of a club consisting of former regular over an inaccessible and a measurable. The foricing construction based on iteration of distributive posets.
We investigate iterating the construction of $C^{*}$, the $L$-like inner model constructed using first order logic augmented with the "cofinality $\omega$" quantifier. We first show that $\left(C^{*}\right)^{C^{*}}=C^{*}\ne L$ is…
Iterative imputation, in which variables are imputed one at a time each given a model predicting from all the others, is a popular technique that can be convenient and flexible, as it replaces a potentially difficult multivariate modeling…
The goal of this work is to enable a team of quadrotors to learn how to accurately track a desired trajectory while holding a given formation. We solve this problem in a distributed manner, where each vehicle has only access to the…
We obtain strong coloring theorems at successors of singular cardinals from failures of certain instances of simultaneous reflection of stationary sets. Along the way, we establish new results in club-guessing and in the general theory of…
In this paper we present a systematic study of continuous local iterated function systems. We prove local iterated function systems admit compact attractors and, under a contractivity assumption, construct their code space and present an…
Mixture transition distribution time series models build high-order dependence through a weighted combination of first-order transition densities for each one of a specified number of lags. We present a framework to construct stationary…
We prove distributional limit theorems and one-sided laws of the iterated logarithm for a class of positive, mixing, stationary, stochastic processes which contains those obtained from non-integrable observables over certain piecewise…
We discovered that certain patterns called injective patterns remain stable during the revolution process, allowing us to create many reversible CA simply by using them to design the revolution rules. By examining injective patterns, we…
We define iterated monodromy groups of more general structures than partial self-covering. This generalization makes it possible to define a natural notion of a combinatorial model of an expanding dynamical system. We prove that a naturally…
On-line social networks, such as in Facebook and Twitter, are often studied from the perspective of friendship ties between agents in the network. Adversarial ties, however, also play an important role in the structure and function of…
In this paper we study $\nu$-CA on one-dimensional lattice defined over a finite set of local rules. The main goal is to determine how the local rules can be mixed to ensure the produced $\nu$-CA has some properties. In a first part, we…
We investigate different set-theoretic constructions in Residuated Logic based on Fitting's work on Intuitionistic Set Theory. We start by stating some results concerning constructible sets within valued models of Set Theory. We present two…
A key generative principle within social and other complex networks is transitivity, where friends of friends are more likely friends. We propose a new model for highly dense complex networks based on transitivity, called the Iterated Local…
We establish the Lyndon interpolation property for basic lattice expansion logics (LE-logics) in arbitrary signatures using display calculi. Our approach is constructive, yielding interpolants algorithmically from derivations, and modular,…
Generative models in molecular design tend to be richly parameterized, data-hungry neural models, as they must create complex structured objects as outputs. Estimating such models from data may be challenging due to the lack of sufficient…
We study some asymptotic variants of the club principle. Along the way, we construct some forcings and use them to separate several of these principles