Bijectivism — Making Every Function Reversible
Abstract
Abstract: We propose Bijectivism, a framework in which every mathematical function has a well‑defined inverse when that inverse is allowed to be set‑valued. Traditionally, a function is called “invertible” only if it is bijective—that is, only if its inverse is single‑valued. This convention unnecessarily restricts our conceptual toolkit and forces piecewise patches (domain restrictions, branch cuts) where a more natural, uniform treatment is possible.
Fields of Study & Subjects
Logic
programming
and type systems
semigroups and automata theory
History and Theory of Mathematics
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 21 February 2026
- Language
- EN
- Document type
- Preprint