Related papers: Inner mantles and iterated HOD

We show that in a weak globular $\omega$-category, all composition operations are equivalent and commutative for cells with sufficiently degenerate boundary, which can be considered a higher-dimensional generalisation of the Eckmann-Hilton…

Assume ZFC. Let $\kappa$ be a cardinal. Recall that a ${<\kappa}$-ground is a transitive proper class $W$ modelling ZFC such that $V$ is a generic extension of $W$ via a forcing $\mathbb{P}\in W$ of cardinality ${<\kappa}$, and the…

Brauer and Thrall conjectured that a finite-dimensional algebra over a field of bounded representation type is actually of finite representation type and a finite-dimensional algebra (over an infinite field) of infinite representation type…

Assuming that ORD is $\omega +\omega $-Erd\"os we show that if a class forcing amenable to $L$ (an $L$-forcing) has a generic then it has one definable in a set-generic extension of $L[O^\#]$. In fact we may choose such a generic to be {\it…

In this paper we introduce the notion of {\it core} for two specific classes of boolean maps on finite involution posets (which are a generalization of the boolean lattices) and we prove some extension results for such families of boolean…

We specify the frontier of decidability for fragments of the first-order theory of ordinal multiplication. We give a NEXPTIME lower bound for the complexity of the existential fragment of $\langle \omega^{\omega^\lambda}; \times, \omega,…

We study invertibility of $\lambda$-terms modulo $\lambda$-theories. Here a fundamental role is played by a class of $\lambda$-terms called finite hereditary permutations (FHP) and by their infinite generalisations (HP). More precisely,…

We analyze the effect of replacing several natural uses of definability in set theory by the weaker model-theoretic notion of algebraicity. We find, for example, that the class of hereditarily ordinal algebraic sets is the same as the class…

The HOM-problem, which asks whether the image of a regular tree language under a tree homomorphism is again regular, is known to be decidable. Since then, weighted versions of this problem for different semirings have also been…

If $\mathcal{L}$ is an abstract logic (a.k.a. model theoretic logic), we can define the inner model $C(\mathcal{L})$ by replacing first order logic with $\mathcal{L}$ in G\"odel's definition of the inner model $L$ of constructible sets. Set…

Using the theory of distributive series of monads, we construct an $(\infty,0)$-coherator called the \emph{inductive coherator}. The category of models out of the inductive coherator serve as a model for $\infty$-groupoids that possess an…

We show that in $L(\mathbb{R})$, assuming large cardinals, $\mathsf{HOD} {\parallel}\eta^{+\mathsf{HOD}}$ is locally definable from $\mathsf{HOD} {\parallel}\eta$ for all $\mathsf{HOD}$-cardinals $\eta\in [\boldsymbol{\delta}^2_1,\Theta)$.…

Measurability with respect to ideals is tightly connected with absoluteness principles for certain forcing notions. We study a uniformization principle that postulates the existence of a uniformizing function on a large set, relative to a…

A heterostructure of a semi-infinite metal and a Mott insulator is considered. It is supposed that both materials have an identical lattice spacing and hopping integrals and differ in the Hubbard repulsion which is negligible in the metal…

We prove a version of the Erd\H{o}s--Beck Theorem from discrete geometry for fractal sets in all dimensions. More precisely, let $X\subset \mathbb{R}^n$ Borel and $k \in [0, n-1]$ be an integer. Let $\dim (X \setminus H) = \dim X$ for every…

The calculus of Dependent Object Types (DOT) has enabled a more principled and robust implementation of Scala, but its support for type-level computation has proven insufficient. As a remedy, we propose $F^\omega_{..}$, a rigorous…

The computational cost of micromechanics for heterogeneous materials can be reduced in certain cases where symmetric boundary conditions are applicable. We derived an eighth symmetric formulation of the Generalized Method of Cells for…

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…

The uninorms with continuous underlying t-norm and t-conorm are characterized via an extended ordinal sum construction. Using the results of [18], where each uninorm with continuous underlying operations was characterized by properties of…

We investigate higher-dimensional $\Delta$-systems indexed by finite sets of ordinals, isolating a particular definition thereof and proving a higher-dimensional version of the classical $\Delta$-system lemma. We focus in particular on…