Cantor-Bernstein implies Excluded Middle

04/19/2019
by   Pierre Pradic, et al.
0

We prove in constructive logic that the statement of the Cantor-Bernstein theorem implies excluded middle. This establishes that the Cantor-Bernstein theorem can only be proven assuming the full power of classical logic. The key ingredient is a theorem of Martín Escardó stating that quantification over a particular subset of the Cantor space 2^N, the so-called one-point compactification of N, preserves decidable predicates.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/25/2023

Binding Logic: proofs and models

We define an extension of predicate logic, called Binding Logic, where v...
research
11/26/2022

Derandomization under Different Resource Constraints

We provide another proof to the EL Theorem. We show the tradeoff between...
research
05/07/2021

Constructing Initial Algebras Using Inflationary Iteration

An old theorem of Adámek constructs initial algebras for sufficiently co...
research
09/06/2023

There are only two paradoxes

Using a graph representation of classical logic, the paper shows that th...
research
03/22/2023

Locality Theorems in Semiring Semantics

Semiring semantics of first-order logic generalises classical Boolean se...
research
12/22/2021

Parametric Church's Thesis: Synthetic Computability without Choice

In synthetic computability, pioneered by Richman, Bridges, and Bauer, on...
research
04/07/2021

A Cycle Joining Construction of the Prefer-Max De Bruijn Sequence

We propose a novel construction for the well-known prefer-max De Bruijn ...

Please sign up or login with your details

Forgot password? Click here to reset