Related papers: Some considerations on Amoeba forcing notions

Imagine being able to ask questions to a black box model such as "Which adversarial examples exist?", "Does a specific attribute have a disproportionate effect on the model's prediction?" or "What kind of predictions could possibly be made…

In the Zermelo--Fraenkel set theory with the Axiom of Choice a forcing notion is "$\kappa$-distributive" if and only if it is "$\kappa$-sequential". We show that without the Axiom of Choice this equivalence fails, even if we include a weak…

We investigate regularity properties derived from tree-like forcing notions in the setting of "generalized descriptive set theory", i.e., descriptive set theory on $\kappa^\kappa$ and $2^\kappa$, for regular uncountable cardinals $\kappa$.

The preservation theorems for semi-properness, hemi-properness, and pseudo-completeness hold for countable support iterations as well as revised countable support iterations, notwithstanding the fact that the "factor lemma" fails for the…

An amoeba is a tree together with instructions how to iteratively grow trees by adding paths of a fixed length $\ell$. This paper analyses such a growth process. An amoeba is mortal if all versions of the process are finite, and it is…

We investigate properties of trees of height $\omega_1$ and their preservation under subcomplete forcing. We show that subcomplete forcing cannot add a new branch to an $\omega_1$-tree. We introduce fragments of subcompleteness which are…

We study the problem of formally verifying individual fairness of decision tree ensembles, as well as training tree models which maximize both accuracy and individual fairness. In our approach, fairness verification and fairness-aware…

We introduce the idea of a coherent adequate set of models, which can be used as side conditions in forcing. As an application we define a forcing poset which adds a square sequence on $\omega_2$ using finite conditions.

The main result of this paper is a partial answer to [math.LO/9909115, Problem 5.5]: a finite iteration of Universal Meager forcing notions adds generic filters for many forcing notions determined by universality parameters. We also give…

Complete non-ambiguous trees have been studied in various contexts. Recently, a conjecture was made about their determinants, and subsequently proved by Aval. An alternative proof is given here.

We show that compact cardinals and {\rm MM} are sensitive to $\lambda$-closed forcings for arbitrarily large $\lambda$. This is done by adding 'regressive' $\lambda$-Kurepa-trees in either case. We argue that the destruction of regressive…

We study variants of classical Laver forcing defined from co-ideals and analyze their combinatorial properties in terms of the Kat\v{e}tov order. In particular, we give a Kat\v{e}tov-theoretic characterization of when Laver forcing…

We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…

The last decade has shed some light on theoretical properties such as their consistency for regression tasks. In the current paper, we propose a new class of very simple learners based on so-called naive trees. These naive trees partition…

Decision support systems (e.g., for ecological conservation) and autonomous systems (e.g., adaptive controllers in smart cities) start to be deployed in real applications. Although their operations often impact many users or stakeholders,…

The potential lack of fairness in the outputs of machine learning algorithms has recently gained attention both within the research community as well as in society more broadly. Surprisingly, there is no prior work developing tree-induction…

Our original aim was, in Abelian group theory to prove the consistency of: lambda is strong limit singular and for some properties of abelian groups which are relatives of being free, the compactness in singular fails. In fact this should…

We introduce an abstract framework for forcing over a free Suslin tree with suborders of products of forcings which add some structure to the tree using countable approximations. The main ideas of this framework are consistency, separation,…

In this short note, we shall prove some observations regarding the connection between indestructible $\omega_1$-guessing models and the $\omega_1$-approximation property of forcing notions.

We examine the existence (and mostly non-existence) of fresh sets in commonly used iterations of Prikry type forcing notions. Results of [4] are generalized. As an application, a question of a referee of [9] is answered. In addition…