Related papers: Generics for Mathias forcing over general Turing i…
The two parallel concepts of "small" sets of the real line are meagre sets and null sets. Those are equivalent to Cohen forcing and Random real forcing for $\aleph^{\aleph_0}_0$; in spite of this similarity, the Cohen forcing and Random…
Vladimir Kanovei \cite{zbMATH01335192} developed the technique of geometric iteration and used it to prove that the perfect set forcing can be iterated with countable supports along any partial order, while preserving $\aleph_1$. In…
This paper addresses the longstanding problem of determining the structure of the $\leq_{\mathrm{LT}}$-order in the Effective Topos, known to effectively embed the Turing degrees. In a surprising discovery, we show that the…
Foreman proved the Duality Theorem, which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of $\omega_1$ is preserved by any proper forcing. We…
In this paper, we introduce and investigate the notions of Mean Dimension and Metric Mean Dimension for generalized iterated function systems (IFS). We establish basic properties of these invariants and prove that Mean Dimension is always…
Assume that $A_{1},...,A_{s}$ are complex $n\times n$ matrices. We give a computable criterion for existence of a common eigenvector of $A_{i}$ which generalize the result of D. Shemesh established for two matrices. We use this criterion to…
In this paper we define (special) GLIT classes and (special) GLIT algebras. We prove that GLIT algebras, which generalise Lat-Igusa-Todorov algebras, satisfy the finitistic dimension conjecture and give several properties and examples. In…
We present a general framework for forcing on $\omega_2$ with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial…
We develop an algorithm which, given a trained transformer model $\mathcal{M}$ as input, as well as a string of tokens $s$ of length $n_{fix}$ and an integer $n_{free}$, can generate a mathematical proof that $\mathcal{M}$ is…
An MDS matrix is a matrix whose minors all have full rank. A question arising in coding theory is what zero patterns can MDS matrices have. There is a natural combinatorial characterization (called the MDS condition) which is necessary over…
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…
In this paper we introduce and study the notion of dynamical forcing. Basically, we develop a toolkit of techniques to produce finitely presented groups which can only act on the circle with certain prescribed dynamical properties. As an…
Infinite time Turing machines (ITTMs) have been introduced by Hamkins and Lewis in their seminal article arXiv:math/9808093. The strength of the model comes from a limit rule which allows the ITTM to compute through ordinal stages. This…
We build a supercompact version of the forcing defined in \cite{gitik2019}. For each singular cardinal in the ground model with any fixed cofinality, which is a limit of supercompact cardinals, it is possible to force so that the size of…
A question of Bergman asks whether the adjoint of the generic square matrix over a field can be factored nontrivially as a product of square matrices. We show that such factorizations indeed exist over any coefficient ring when the matrix…
We describe a method of building ``nice'' sigma-ideals from Souslin ccc forcing notions. [These notes were written down in 1992, but were not submitted to any journal. In a slightly modified form, they were incorporated to: T. Bartoszynski…
We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $\lambda$, if $\lambda^{++}$…
If $I=(f_1,\ldots,f_r)$ is an ideal in $S=k[x_1,\ldots,x_n]$, and $f_i$ are "general" elements of given degrees, there is a conjecture on the Hilbert series of $S/I$. We are considering the corresponding concepts in bigraded rings.
We develop a forcing poset with finite conditions which adds a partial square sequence on a given stationary set, with adequate sets of models as side conditions. We then develop a kind of side condition product forcing for simultaneously…
The generalized test ideals introduced in [HY] are related to multiplier ideals via reduction to characteristic p. In addition, they satisfy many of the subtle properties of the multiplier ideals, which in characteristic zero follow via…