Related papers: Some models produced by 3D iterations
We introduce a forcing technique to construct three-dimensional arrays of generic extensions through FS (finite support) iterations of ccc posets, which we refer to as 3D-coherent systems. We use them to produce models of new constellations…
Let $\mathcal{E}$ be the $\sigma$-ideal generated by the closed measure zero sets of reals. We use an ultrafilter-extendable matrix iteration of ccc posets to force that, for $\mathcal{E}$, their associated cardinal characteristics (i.e.\…
We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…
Using GCH, we force the following: There are continuum many simple cardinal characteristics with pairwise different values.
We generate and count isomorphism classes of gluing-parallel posets with interfaces (iposets) on up to eight points, and on up to ten points with interfaces removed. In order to do so, we introduce a new class of iposets with full…
Using matrix iterations of ccc posets, we prove the consistency with ZFC of some cases where the cardinals on the right hand side of Cichon's diagram take two or three arbitrary values (two regular values, the third one with uncountable…
3D shape creation and modeling remains a challenging task especially for novice users. Many methods in the field of computer graphics have been proposed to automate the often repetitive and precise operations needed during the modeling of…
We show how to construct, via forcing, splitting families than are preserved by a certain type of finite support iterations. As an application, we construct a model where 15 classical characteristics of the continuum are pairwise different,…
We show that many large cardinal notions up to measurability can be characterized through the existence of certain filters for small models of set theory. This correspondence will allow us to obtain a canonical way in which to assign ideals…
We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation…
A new class of random spatial tessellations is introduced -- the so-called column tessellations of three-dimensional space. The construction is based on a stationary planar tessellation. Each cell of the spatial tessellation is a prism…
We show that we can construct a model in 3+1 dimensions where it is necessary that composite vector particles take place in physical processes as incoming and outgoing particles . Cross-section of the processes in which only the constituent…
Repetitive patterns are ubiquitous in natural and human-made objects, and can be created with a variety of tools and methods. Manual authoring provides unmatched degree of freedom and control, but can require significant artistic expertise…
This is a major update of the previous version. The methods of the paper are now fully constructive and the style is "formalization ready" with the emphasis on the possibility of formalization both in type theory and in constructive set…
I propose a scheme of constructing classical integrable models in 3+1 discrete dimensions, based on a relaxed version of the problem of factorizing a matrix into the product of four matrices of a special form.
We present the classical theory of preservation of $\sqsubset$-unbounded families in generic extensions by ccc posets, where $\sqsubset$ is a definable relation of certain type on spaces of real numbers, typically associated with some…
We construct a variety of inner models exhibiting features usually obtained by forcing over universes with large cardinals. For example, if there is a supercompact cardinal, then there is an inner model with a Laver indestructible…
Four constructions result from a desire to create enhancements to Cantor's infinite real set cardinality. Each continues to keep Cantor's cardinality formulation in place while providing new comparisons of arbitrary infinite sets. To…
We study selective and game-theoretic versions of properties like the ccc, weak Lindel\"ofness and separability, giving various characterizations of them and exploring connections between these properties and some classical cardinal…
An algorith to count, or alternatively generate, all k-element transversals of a set system is presented and compared with three known methods. For special cases it works in output-linear time.