Related papers: How to have more things by forgetting how to count…
We work in the setting of Zermelo-Fraenkel set theory without assuming the Axiom of Choice. We consider sets with the Boolean operations together with the additional structure of comparing cardinality (in the Cantorian sense of injections).…
We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…
This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…
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…
A set $A$ is dually Dedekind finite if every surjection from $A$ onto $A$ is injective; otherwise, $A$ is dually Dedekind infinite. It is proved consistent with $\mathsf{ZF}$ (i.e., the Zermelo--Fraenkel set theory without the axiom of…
In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B is a G-delta-sigma set, then either B is countable or B contains a perfect subset. Second, we…
This paper introduces an alternative approach to proving the existence of choice functions for specific families of sets within Zermelo-Fraenkel set theory (ZF) without assuming any form on the Axiom of Choice (AC). Traditional methods of…
It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…
We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…
We present a set-theoretic, proof-irrelevant model for Calculus of Constructions (CC) with predicative induction and judgmental equality in Zermelo-Fraenkel set theory with an axiom for countably many inaccessible cardinals. We use Aczel's…
Given an inner model $W \subset V$ and a regular cardinal $\kappa$, we consider two alternatives for adding a subset to $\kappa$ by forcing: the Cohen poset $Add(\kappa,1)$, and the Cohen poset of the inner model $Add(\kappa,1)^W$. The…
The uncountability of the reals was first established by Cantor in what was later heralded as the first paper on set theory. Since the latter constitutes the official foundations of mathematics, the logical study of the uncountability of…
It is shown how Dedekind cuts can be used to introduce the extended real numbers along with sound arithmetic laws via one simple rule for the addition of sets. The crucial idea is that the use of the lower and the upper part of the cuts,…
The paper is devoted to construction of some closed inductive sequence of models of the generalized second-order Dedekind theory of real numbers with exponentially increasing powers. These models are not isomorphic whereas all models of the…
For an infinite cardinal $\kappa$, let $ded\kappa$ denote the supremum of the number of Dedekind cuts in linear orders of size $\kappa$. It is known that $\kappa<ded\kappa\leq 2^{\kappa}$ for all $\kappa$ and that $ded\kappa<2^{\kappa}$ is…
This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…
A set $A$ is dually Dedekind finite if every surjection from $A$ onto $A$ is injective; otherwise, $A$ is dually Dedekind infinite. An amorphous set is an infinite set that cannot be partitioned into two infinite subsets. A strictly…
Fairly deep results of Zermelo-Frenkel (ZF) set theory have been mechanized using the proof assistant Isabelle. The results concern cardinal arithmetic and the Axiom of Choice (AC). A key result about cardinal multiplication is K*K = K,…
It is well known that ZFC, despite its usefulness as a foundational theory for mathematics, has two unwanted features: it cannot be written down explicitly due to its infinitely many axioms, and it has a countable model due to the…
This paper is a contribution to the study of extensions of arbitrary models of ZF (Zermelo-Fraenkel set theory), with no regard to countability or well-foundedness of the models involved. We present some new constructions of certain types…