Related papers: Does $\mathsf{DC}$ imply $\mathsf{AC}_\omega$, uni…

We show that the axiom of choice, a basic yet controversial postulate of set theory, leads to revise the standard understanding of one of the pillars of our best physical theories, namely the no-signaling principle. While it is well known…

Douglass B. Morris announced in 1970 that it is consistent with ZF that "For every $\alpha$, there exists a set $A_\alpha$ which is the countable union of countable sets, and $\mathcal P(A_\alpha)$ can be partitioned into $\aleph_\alpha$…

Let X be a finite set of alternatives. A choice function c is a mapping which assigns to nonempty subsets S of X an element c(S) of S. A rational choice function is one for which there is a linear ordering on the alternatives such that c(S)…

We present a simple proof of a well-known axiomatic characterization of state-salient decision rules, using Weak Dominance Criterion and Global Independence of Irrelevant Alternatives. Subsequently we provide a simple axiomatic…

We give a brief survey on the interplay between forcing axioms and various other non-constructive principles widely used in many fields of abstract mathematics, such as the axiom of choice and Baire's category theorem. First of all we…

In this paper we prove that the maximum principle in forcing is equivalent to the axiom of choice. The maximum principle is the property of forcing: p ||- exists x theta(x) iff for some name tau p ||- theta(tau). We also look at three…

We show that it is relatively consistent with ZF that the Borel hierarchy on the reals has length $\omega_2$. This implies that $\omega_1$ has countable cofinality, so the axiom of choice fails very badly in our model. A similar argument…

In the setting of constructive reverse mathematics, we analyse the downward L\"owenheim-Skolem (DLS) theorem of first-order logic, stating that every infinite model has a countable elementary submodel. Refining the well-known equivalence of…

In the context of $\mathsf{ZF}+\mathsf{DC}$, we force $\mathsf{DC}_\kappa$ for relations on $\mathcal{P}(\kappa)$ for $\kappa{}<\aleph_\omega$ over the Chang model $\mathrm{L}(\mathrm{Ord}^\omega)$ making some assumptions on the thorn…

We introduce neutrosophic choice functions, the neutrosophic counterpart of the Axiom of Choice, prove some results, and discuss how it effects the foundations of mathematics in a neutrosophic setting.

In this note we are concerned with the validity of an uncountable analogue of a combinatorial lemma due to Vlastimil Pt\'ak. We show that the validity of the result for $\omega_1$ can not be decided in ZFC alone. We also provide a…

We show that there is always a uniformly antisymmetric f:A-> {0,1} if A subset R is countable. We prove that the continuum hypothesis is equivalent to the statement that there is an f:R-> omega with |S_x| <= 1 for every x in R. If the…

"Church's thesis" ($\mathsf{CT}$) as an axiom in constructive logic states that every total function of type $\mathbb{N} \to \mathbb{N}$ is computable, i.e. definable in a model of computation. $\mathsf{CT}$ is inconsistent in both…

Category-measure duality concerns applications of Baire-category methods that have measure-theoretic analogues. The set-theoretic axiom needed in connection with the Baire category theorem is the Axiom of Dependent Choice DC rather than the…

Let m>2 be an integer. We show that ZF + "For every integer n, Every countable family of non-empty sets of cardinality at most n has an infinite partial choice function" is not strong enough to prove that every countable set of m-element…

We analyze the pointwise convergence of a sequence of computable elements of L^1(2^omega) in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA_0,…

Let $(X,\tau)$ be a Hausdorff space and $n\in\omega$. We prove that if $X$ admits a continuous selection over $\mathcal{F}_{n}(X)$ (nonempty subsets of $X$ of cardinality at most $n$), then for every $n\leq m\leq 2n$ such that $m$ is not a…

I prove several independence results in the choiceless ZF+DC theory which separate algebraic and non-algebraic consequences of the axiom of choice.

Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…

Given a property $P$ of subspaces of a $T_1$ space $X$, we say that $X$ is {\em $P$-bounded} iff every subspace of $X$ with property $P$ has compact closure in $X$. Here we study $P$-bounded spaces for the properties $P \in \{\omega D,…