Related papers: Cantor-Bernstein implies Excluded Middle

We present a simpler way than usual to deduce the completeness theorem for the second-oder classical logic from the first-order one. We also extend our method to the case of second-order intuitionistic logic.

We begin with a context more general than set theory. The basic ingredients are essentially the object and functor primitives of category theory, and the logic is weak, requiring neither the Law of Excluded Middle nor quantification. Inside…

We study criteria for a ring - or more generally, for a small category - to be Gorenstein and for a module over it to be of finite projective dimension. The goal is to unify the universal coefficient theorems found in the literature and to…

Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…

We present an elementary combinatorial proof of the celebrated Friendship theorem. The proof involves looking at independent sets and constructing a bound on their size which forces a contradiction.

We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. (T.1) A basic property of Cantor space $2^{\mathbb{N}}$…

We prove sharp Landau- and Schottky-type theorems for analytic functions which omit the $n$-th roots of unity. The proofs are based on a sharp lower bound for the Poincar\'e metric of the complex plane punctured at the roots of unity.

We investigate splitting-type variational problems with some linear growth conditions. For balanced solutions of the associated Euler-Lagrange equation we receive a result analogous to Bernstein's theorem on non-parametric minimal surfaces.…

We show that the well-known Konig's Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, can be proven in the first order theory $\LA$ with induction restricted to $\Sigma_1^B$ formulas. This is an improvement over…

We introduce the concept of compact quantitative equational theory. A quantitative equational theory is defined to be compact if all its consequences are derivable by means of finite proofs. We prove that the theory of interpolative…

We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…

The first author and Latr\'emoli\`ere had introduced a quantum metric (in the sense of Rieffel) on the algebra of complex-valued continuous functions on the Cantor space. We show that this quantum metric is distinct from the quantum metric…

We prove that there exists a nonprincipal ultrafilter $\mathcal U$ on $\mathbb N$ such that for every countable (or separable) structure $B$ in a countable language the quotient map from the reduced product associated with the Fr\'echet…

If $A$ and $B$ are $n$- and $m$-representation finite $k$-algebras, then their tensor product $\Lambda = A\otimes_k B$ is not in general $(n+m)$-representation finite. However, we prove that if $A$ and $B$ are acyclic and satisfy the weaker…

It is a classical theorem of Alexandroff that a locally compact Hausdorff space has a one-point Hausdorff compactification if and only if it is non-compact. The one-point Hausdorff compactification is indeed obtained by adding the so called…

A well-known theorem of Burnside says that if $\rho$ is a faithful representation of a finite group $G$ over a field of characteristic $0$, then every irreducible representation of $G$ appears as a constituent of a tensor power of $\rho$.…

An outlier is a datapoint that is set apart from a sample population. The outlier theorem in algorithmic information theory states that given a computable sampling method, outliers must appear. We present a simple proof to the outlier…

We prove that the category of countable Tate modules over an arbitrary discrete ring embeds fully faithfully into that of condensed modules. If the base ring is of finite type, we characterize the essential image as generated by the free…

Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…

Let $X$ be a compact subset of the complex plane and $x \in X$. A necessary and sufficient condition is given in terms of Hausdorff contents for the existence of a bounded point derivation at $x$ on the space of vanishing Campanato…