Related papers: Counterexamples to Cantorian Set Theory
In the course of many mathematical developments involving 'number systems' like $\mathbb{N}, \mathbb{Z}, \mathbb{Q}, \mathbb{R}, \mathbb {C}$ etc., it sometimes becomes necessary to abstract away and study certain properties of the number…
Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…
We give an analysis over a variation of causal sets where the light cone of an event is represented by finitely branching trees with respect to any given arbitrary dynamics. We argue through basic topological properties of Cantor space that…
Quantum theory allows for the superposition of causal orders between operations, i.e., for an indefinite causal order; an implication of the principle of quantum superposition. Since a higher theory might also admit this feature, an…
This survey synthesizes the principal descriptive set-theoretic perspectives on deterministic Cantor sets on the real line and charts directions for future study. After recounting their historical genesis and compiling an up-to-date…
We provide a pure algebraic version of the dynamical characterization of Conrad's property. This approach allows dealing with general group actions on totally ordered spaces. As an application, we give a new and somehow constructive proof…
The title theorem is proved by example: an algebra of binary relations, closed under intersection and composition, that is not isomorphic to any such algebra on a finite set.
Whatever other beliefs there may remain for considering Cantor's diagonal argument as mathematically legitimate, there are three that, prima facie, lend it an illusory legitimacy; they need to be explicitly discounted appropriately. The…
The property of countable metacompactness of a topological space gets its importance from Dowker's 1951 theorem that the product of a normal space X with the unit interval is again normal iff X is countably metacompact. In a recent paper,…
We give a proof of the inconsistency of PM arithmetic, classical set theory and related systems, incidentally exposing an error in Goedel's own proof of Goedel's Theorems. The inconsistency proof, that formulae of the form R and ~R occur as…
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,…
We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces significantly the exhaustive generation. New enumerative…
A pattern is called universal in another collection of sets, when every set in the collection contains some linear and translated copy of the original pattern. Paul Erd\H{o}s proposed a conjecture that no infinite set is universal in the…
Let P be the direct product of countably many copies of the additive group Z of integers. We study, from a set-theoretic point of view, those subgroups of P for which all homomorphisms to Z annihilate all but finitely many of the standard…
This paper develops a rich theory of cardinality in the paraconsistent and paracomplete set theory $\mathrm{BZFC}$, where sets can be inconsistent ($A$ such that ``$x\in A$'' is both true and false for some $x$) or incomplete ($A$ such that…
This thesis concerns embeddings and self-embeddings of foundational structures in both set theory and category theory. The first part of the work on models of set theory consists in establishing a refined version of Friedman's theorem on…
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…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
In 1960s, Dana Scott gave a recursion theoretic characterization of standard systems of countable non-standard models of arithmetic, i.e., collections of sets of standard natural numbers coded in non-standard models. Later, Knight and Nadel…
The representation of mathematical objects in terms of (more) basic ones is part and parcel of (the foundations of) mathematics. In the usual foundations of mathematics, i.e. $\textsf{ZFC}$ set theory, all mathematical objects are…