相关论文: More on Cardinal Arithmetic

In a locally $\lambda$-presentable category, with $\lambda$ a regular cardinal, classes of objects that are injective with respect to a family of morphisms whose domains and codomains are $\lambda$-presentable, are known to be characterized…

Using a theorem from pcf theory, we show that for any singular cardinal nu, the product of the Cohen forcing notions on kappa, kappa < nu adds a generic for the Cohen forcing notion on nu^+. This solves Problem 5.1 in Miller's list…

Given an arbitrary measurable cardinal $\kappa$, a nondiscrete Hausdorff extremally disconnected topological group of cardinality $\kappa$ is constructed.

Large cardinals arising from the existence of arbitrarily long end elementary extension chains over models of set theory are studied here. In particular, we show that the large cardinals obtained that way (`Unfoldable cardinals') behave as…

It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…

Given any $\lambda\leq\kappa$, we construct a symmetric extension in which there is a set $X$ such that $\aleph(X)=\lambda$ and $\aleph^*(X)=\kappa$. Consequently, we show that $\mathsf{ZF}+$"For all pairs of infinite cardinals…

Using the methods of quantisation ideals, we construct a family of quantisations corresponding to Case alpha in Sergeev's classification of solutions to the tetrahedron equation. This solution describes transformations between special…

Let $\mathcal{F}=\{F_{\alpha}: \alpha\in \mathcal{A}\}$ be a family of infinite graphs, together with $\Lambda$. The Factorization Problem $FP(\mathcal{F}, \Lambda)$ asks whether $\mathcal{F}$ can be realized as a factorization of…

We investigate the unbalanced ordinary partition relations of the form $\lambda \rightarrow {(\lambda, \alpha)}^{2}$ for various values of the cardinal $\lambda$ and the ordinal $\alpha$. For example, we show that for every infinite…

The work presents the brief exposition of the proof (in ZF) of inaccessible cardinals nonexistence. To this end in view there is used the apparatus of subinaccessible cardinals and its basic tools -- reduced formula spectra and matrices and…

Our goal is to study the pseudo-intersection and tower numbers on uncountable regular cardinals, whether these two cardinal characteristics are necessarily equal, and related problems on the existence of gaps. First, we prove that either…

Typestate systems ensure many desirable properties of imperative programs, including initialization of object fields and correct use of stateful library interfaces. Abstract sets with cardinality constraints naturally generalize typestate…

Let $\kappa$,$\lambda$ be regular uncountable cardinals such that $\lambda > \kappa^+$ is not a successor of a singular cardinal of low cofinality. We construct a generic extension with $s(\kappa) = \lambda$ starting from a ground model in…

In a paper from 1997, Shelah asked whether $Pr_1(\lambda^+,\lambda^+,\lambda^+,\lambda)$ holds for every inaccessible cardinal $\lambda$. Here, we prove that an affirmative answer follows from $\square(\lambda^+)$. Furthermore, we establish…

This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…

We provide a list of new natural $\mathsf{VNP}$-intermediate polynomial families, based on basic (combinatorial) $\mathsf{NP}$-complete problems that are complete under parsimonious reductions. Over finite fields, these families are in…

For lambda phi^4 problems, convergent perturbative series can be obtained by cutting off the large field configurations. The modified series converge to values exponentially close to the exact ones. For lambda larger than some critical…

Lambda calculus is the basis of functional programming and higher order proof assistants. However, little is known about combinatorial properties of lambda terms, in particular, about their asymptotic distribution and random generation.…

A partial combinatory algebra (PCA) is a set equipped with a partial binary operation that models a notion of computability. This paper studies a generalization of PCAs, introduced by W. Stekelenburg, where a PCA is not a set but an object…

Extending a result of the first author and Katsura, we prove that for every UHF algebra $A$ of infinite type, in every uncountable cardinality $\kappa$ there are $2^\kappa$ nonisomorphic approximately matricial C*-algebras with the same…