Related papers: Full normalization for $\kappa^+$-supercompactness

We describe the extension of normal iteration strategies with appropriate condensation properties to strategies for stacks of normal trees, with full normalization. Given a regular uncountable cardinal $\Omega$ and an…

We develop the theory of meta-iteration trees, that is, iteration trees whose base "model" is itself an ordinary iteration tree. We prove a comparison theorem for meta-iteration strategies parallel to the one for ordinary iteration…

We establish natural criteria under which normally iterable premice are iterable for stacks of normal trees. Let $\Omega$ be a regular uncountable cardinal. Let $m<\omega$ and $M$ be an $m$-sound premouse and $\Sigma$ be an…

We give a development of the fine structure of mice with long extenders, to the level of $\kappa^+$-supercompact cardinals $\kappa$. We do this using a hierarchy with features more analogous to those familiar in the short extender context…

We show that if $\lambda^{<\kappa} = \lambda$ and every normal filter on $P_\kappa\lambda$ can be extended to a $\kappa$-complete ultrafilter then so does every $\kappa$-complete filter on $\lambda$. This answers a question of Gitik.

We develop a general theory of strategic mice, prove their condensation properties, and analyze the scales pattern in the stack of $\Theta$-g-organized $\mathcal{F}$-mice over $\mathbb{R}$, Lp$^{G\mathcal{F}}(\mathbb{R})$, for a class of…

A weight normalization procedure, commonly called pushing, is introduced for weighted tree automata (wta) over commutative semifields. The normalization preserves the recognized weighted tree language even for nondeterministic wta, but it…

We introduce a class of notions of forcing which we call $\Sigma$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $\Sigma$-Prikry. We show that given…

If T is an iteration tree on K and F is a countably certified extender that coheres with the final model of T, then F is on the extender sequence of the final model of T. Several applications of maximality are proved, including: o K…

We develop the theory of layered posets, and use the notion of layering to prove a new iteration theorem (Theorem 6): if $\kappa$ is weakly compact then any universal Kunen iteration of $\kappa$-cc posets (each possibly of size $\kappa$) is…

Purpose: To systematically investigate the influence of various data consistency layers, (semi-)supervised learning and ensembling strategies, defined in a $\Sigma$-net, for accelerated parallel MR image reconstruction using deep learning.…

We study which $\kappa$-distributive forcing notions of size $\kappa$ can be embedded into tree Prikry forcing notions with $\kappa$-complete ultrafilters under various large cardinal assumptions. An alternative formulation -- can the…

We show that (i) the standard fine structural properties for premice follow from normal iterability (whereas the classical proof relies on iterability for stacks of normal trees), and (ii) every mouse which is finitely generated above its…

In this paper, we present a general realizability semantics for the simply typed $\lambda\mu$-calculus. Then, based on this semantics, we derive both weak and strong normalization results for two versions of the $\lambda\mu$-calculus…

We construct a model in which all $C$-sequences are trivial, yet there exists a $\kappa$-Souslin tree with full vanishing levels. This answers a question of Lambie-Hanson and Rinot, and provides an optimal combination of compactness and…

We develop a unified framework for iterated symmetric extensions with countable support and, more generally, with $<\kappa$-support. Set-length iterations are treated uniformly, and when the iteration template is first-order definable over…

We consider $K$-semialgebras for a commutative semiring $K$ that are at the same time $\Sigma$-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over…

The $R_{\sigma,t}$-transform introduced by Bassa and Menares can be used to construct families of irreducible polynomials in $\mathbb{F}_q[x]$. This iterative construction is a generalization of Cohen's $R$-transform. For this transform,…

We show that the theory $I\Sigma_1$ of $\Sigma_1$-induction proves the following statement: For all $n\geq 2$, the uniform $\Sigma_1$-reflection principle over the theory $I\Sigma_n$ is equivalent to the totality of the function…

We study a categorical generalisation of tree automata, as $\Sigma$-algebras for a fixed endofunctor $\Sigma$ endowed with initial and final states. Under mild assumptions about the base category, we present a general minimisation algorithm…