Related papers: Revised support iterations and CH
We prove a theorem on iterated forcing that can be used for preservation of $\aleph_2$ and $\aleph_1$ in iterations with supports of size $\aleph_1$ of forcings that have amalgamation properties similar to those present in the perfect set…
Boney and Grossberg [BG] proved that every nice AEC has an independence relation. We prove that this relation is unique: In any given AEC, there can exist at most one independence relation that satisfies existence, extension, uniqueness and…
A central theme in set theory is to find universes with extreme, well-understood behaviour. The case we are interested in is assuming GCH and has a strong forcing axiom of higher order than usual. Instead of "for every suitable forcing…
In my PhD thesis a version of Shelah's Presentation Theorem in the setting of Metric Abstract Elementary Classes was proved, where we claimed that the new function symbols are not necessarily uniformly continuous. In this paper we provide a…
Given a sequence $\mathscr{A}=\{a_0<a_1<a_2\ldots\}\subseteq \mathbb{N}$, let $r_{\mathscr{A},h}(n)$ denote the number of ways $n$ can be written as the sum of $h$ elements of $\mathscr{A}$. Fixing $h\geq 2$, we show that if $f$ is a…
It is shown that the method of infinitesimal generators ("Racah's method") can be broadly and systematically formulated as a method applicable to the calculation of reduced coupling coefficients for a generic subalgebra chain G>H, provided…
RL-trained Lean theorem provers mode-collapse at inference time: on miniF2F-test with DeepSeek-Prover-V1.5-RL, doubling the i.i.d.\ sampling budget from $k{=}32$ to $k{=}64$ produces zero additional solved theorems (42/244 in both cases). A…
We investigate a model theoretic invariant $\kappa_{srd}^m(T)$, which was introduced by Shelah in his famous book, and prove that $\kappa_{srd}^m(T)$ is sub-additive. When $\kappa_{srd}^m(T)$ is infinite, this gives the equality…
Unlike in TFNP, for which there is an abundance of problems capturing natural existence principles which are incomparable (in the black-box setting), Kleinberg et al. [KKMP21] observed that many of the natural problems considered so far in…
We address the Riemann and Cauchy problems for systems of $n$ conservation laws in $m$ unknowns which are subject to $m-n$ constraints ($m\geq n$). Such constrained systems generalize systems of conservation laws in standard form to include…
The purpose of this paper is to present a general method for forcing on $\omega_2$ and $\omega_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing…
Farkas' lemma for semidefinite programming characterizes semidefinite feasibility of linear matrix pencils in terms of an alternative spectrahedron. In the well-studied special case of linear programming, a theorem by Gleeson and Ryan…
By considering the prime zeta function, the author intended to demonstrate in that the Riemann zeta function zeta(s) does not vanish for Re(s)>1/2, which would have proven the Riemann hypothesis. However, he later realised that the proof of…
We construct, from a ground model of $ZFC$, a transitive symmetric model $M$ satisfying $ZF + DC + PP + AC_{wo} + \neg AC$. The construction starts with a Cohen symmetric seed model $N$ over $Add(\omega,\omega_1)$ and performs an Ord-length…
We continue investigations of reasonable ultrafilters on uncountable cardinals defined in math.LO/0407498. We introduce stronger properties of ultrafilters and we show that those properties may be handled in lambda-support iterations of…
I develop in depth the machinery of $(\mathcal L, n)$-models originally introduced by Shelah and, independently in a slightly different form by Kripke. This machinery allows fairly routine constructions of true but unprovable sentences in…
An $\aleph_1$-Souslin tree is a complicated combinatorial object whose existence cannot be decided on the grounds of ZFC alone. But 15 years after Tennenbaum and independently Jech devised notions of forcing for introducing such a tree,…
A property of a filter, a kind of large cardinal property, suffices for the proof in Liu Shelah [LiSh:484] and is proved consistent as required there. A natural property which looks better, not only is not obtained here, but is shown to be…
The main goal of this paper is to generalize the results that where presented in [11] for $\aleph_1$-Kurepa trees to $\aleph_{\alpha+1}$-Kurepa trees. We construct an $\mathcal{L}_{\omega_1,\omega}$-sentence $\psi_{\alpha}$, that codes…
We study global subalgebras of superconformal algebras in two dimensions and their unitary representations. Global superconformal multiplets are decomposed into conformal multiplets using Racah-Speiser algorithm, revealing many essential…