Related papers: Cantor-Bernstein implies Excluded Middle

In this paper we prove that the set of countable bqos (viewed as a subset of the Cantor space) is Pi^1_2-complete. The notion of bqo or better quasi-ordering arises from combinatorics and is a generalization of the canonical example of a…

Martin's remarkable proof of $\mathbf{\Pi}^1_2$-determinacy from an iterable rank-into-rank embedding highlighted the connection between large cardinals and determinacy. In this paper, we isolate a large cardinal object called a measurable…

In an earlier paper, we established a natural connection between the Baum-Connes conjecture and noncommutative Bloch theory, viz. the spectral theory of projectively periodic elliptic operators on covering spaces. We elaborate on this…

Magnitude is a canonical invariant of finite metric spaces which has its origins in category theory; it is analogous to cardinality of finite sets. Here, by approximating certain compact subsets of Euclidean space with finite subsets, the…

The center of mass of a finite measure with respect to a radially increasing weight is shown to exist, be unique, and depend continuously on the measure.

This expository note presents a constructive proof of Wigner's theorem using only a few basic facts about Hilbert spaces, such as the existence of orthonormal bases and the Fourier decomposition of a vector. Our proof is based on a proof by…

For a countable, weakly minimal theory, we show that the Schroeder-Bernstein property (any two elementarily bi-embeddable models are isomorphic) is equivalent to both a condition on orbits of rank 1 types and the property that the theory…

Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational…

For infinite products of compact spaces, Tychonoff's theorem asserts that their product is compact, in the product topology. Tychonoff's theorem is shown to be equivalent to the axiom of choice. In this paper, we show that any countable…

Tennenbaum's theorem states that the only countable model of Peano arithmetic (PA) with computable arithmetical operations is the standard model of natural numbers. In this paper, we use constructive type theory as a framework to revisit,…

We prove Bergman's theorem on centralizers by using generic matrices and Kontsevich's quantization method. For any field $\textbf{k} $ of positive characteristics, set $A=\textbf{k} \langle x_1,\dots,x_s\rangle$ be a free associative…

The general methods which are powerful for the necessity of bounded commutators are given. As applications, some necessary conditions for bounded commutators are first obtained in certain endpoint cases, and several new characterizations of…

It is shown that the pillars of transfinite set theory, namely the uncountability proofs, do not hold. (1) Cantor's first proof of the uncountability of the set of all real numbers does not apply to the set of irrational numbers alone, and,…

Let $K$ be a square Cantor set, i.e. the Cartesian product $K=E\times E$ of two linear Cantor sets. Let $\delta_n$ denote the proportion of the intervals removed in the $n$th stage of the construction of $E$. It is shown that if…

The Kestelman-Borwein-Ditor Theorem asserts that a non-negligible subset of $\mathbb{R}$ which is Baire (=has the Baire property, BP) or measurable is shift-compact: it contains some subsequence of any null sequence to within translation by…

We give a simple and direct proof that super-consistency implies the cut elimination property in deduction modulo. This proof can be seen as a simplification of the proof that super-consistency implies proof normalization. It also takes…

We show that every general theory \`a la Keisler with the Schr\"oder-Bernstein property is stable. This generalizes the corresponding result from classical logic due to John Goodrick. Our proof uses the classical result (generalized to the…

Notions of rank abound in the literature on tensor decomposition. We prove that strength, recently introduced for homogeneous polynomials by Ananyan-Hochster in their proof of Stillman's conjecture and generalised here to other tensors, is…

Herbrand's theorem is one of the most fundamental insights in logic. From the syntactic point of view, it suggests a compact representation of proofs in classical first- and higher-order logic by recording the information of which instances…

We give a heuristic for the number of reduced rationals on Cantor's middle thirds set, with a fixed bound on the denominator. We also describe extensive numerical computations supporting this heuristic.