Related papers: A club guessing toolbox I
We investigate the interaction between compactness principles and guessing principles in the Radin forcing extensions. In particular, we show that in any Radin forcing extension with respect to a measure sequence on $\kappa$, if $\kappa$ is…
The star versions of the Scheepers property, namely star-Scheepers, strongly star-Scheepers and new star-Scheepers property have been introduced. We explore further ramifications concerning critical cardinalities. Quite a few interesting…
Complexity develops via the incorporation of innovative properties. Chess is one of the most complex strategy games, where expert contenders exercise decision making by imitating old games or introducing innovations. In this work, we study…
We define a weak iterability notion that is sufficient for a number of arguments concerning $\Sigma_1$-definability at uncountable regular cardinals. In particular we give its exact consistency strength firstly in terms of the second…
We regard Forcing Notions P adding real numbers and the algebras of P-measurable sets. As for Cohen- and Random-Forcing we can show that each analytic set is P-measurable using Solovay's Unfolding Trick for infinite games. To show this we…
The purpose of this article is to prove that the forcing axiom for completely proper forcings is inconsistent with the Continuum Hypothesis. This answers a longstanding problem of Shelah. The corresponding completely proper forcing which…
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…
We revisit several results concerning club principles and nonsaturation of the nonstationary ideal, attempting to improve them in various ways. So we typically deal with a (non necessarily normal) ideal $J$ extending the nonstationary ideal…
We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs. For this purpose, we…
The work presents the second part of the second edition of its previous one published in 2000 under the same title, containing the proof (in ZF) of the inaccessible cardinals nonexistence, which is enriched and improved now. This part…
Clustering is a fundamental problem in data science with a long-standing research history, yielding numerous insightful algorithms. Despite this progress, a systematic and large-scale empirical evaluation that jointly considers conventional…
We revise and extend the stochastic approach to cumulative weak lensing (hereafter the sGL method) first introduced in Ref. [1]. Here we include a realistic halo mass function and density profiles to model the distribution of mass between…
A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…
Let $M$ denote the Merimovich's model in which for each infinite cardinal $\lambda, 2^\lambda=\lambda^{+3}$. We show that in $M$ the following hold: (1) Shelah's strong hypothesis fails at all singular cardinals, indeed, $\forall \lambda…
We consider mainly the following version of set theory:"ZF + DC and for every $\lambda,\lambda^{\aleph_0}$ is well ordered", our thesis is that this is a reasonable set theory, e.g. much can be said. In particular, we prove that for a…
Models in which the number of goals scored by a team in a soccer match follow a Poisson distribution, or a closely related one, have been widely discussed. We here consider a soccer match as an experiment to assess which of two teams is…
It is well-known that the Continuum Hypothesis (CH) is independent of the other axioms of Zermelo-Fraenkel set theory with choice (ZFC). This raises the question of whether an intuitive justification exists for CH as an additional axiom, or…
Many scale-free networks exhibit a rich club structure, where high degree vertices form tightly interconnected subgraphs. In this paper, we explore the emergence of rich clubs in the context of shortest path based centrality metrics. We…
Motivated by a characterization of weakly compact cardinals due to Todorcevic, we introduce a new cardinal characteristic, the C-sequence number, which can be seen as a measure of the compactness of a regular uncountable cardinal. We prove…
New proposals for causal discovery algorithms are typically evaluated using simulations and a few selected real data examples with known data generating mechanisms. However, there does not exist a general guideline for how such evaluation…