Set Duplicability and Schröder-Bernstein Theorem

2024 · doi:10.20944/preprints202411.1021.v2
preprint OA: closed CC-BY-4.0
🔓 Open OA copy View at publisher
⚙ AI-generated summary by claude@2026-07, 2026-07-14 ⓘ

This paper shows that set duplicability offers a more intuitive proof of the Schröder-Bernstein Theorem, a key result in cardinal number theory.

One-sentence paraphrase of the abstract; not a substitute for reading it. No clinical advice. How this works

Abstract

Set duplicability is considered by showing that it provides an easy proof of Schröder-Bernstein Theorem, a fundamental result in the theory of cardinal numbers, usually based on arguments that are not very intuitive.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2024) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-24T02:00:01.246996+00:00
License: CC-BY-4.0