A transfer principle for second-order arithmetic, and applications
Merlin Carl, Asgar Jamneshan

TL;DR
This paper develops a transfer principle based on second-order arithmetic that allows classical theorems in mathematics to be extended into a conditional framework, simplifying proofs and broadening applicability.
Contribution
It formulates and proves a general transfer principle for second-order arithmetic, enabling easier derivation of conditional versions of classical theorems across various mathematical fields.
Findings
Simplified proofs of conditional theorems like Peano existence and Urysohn's lemma.
Extension of classical results to conditional frameworks in functional analysis and measure theory.
Comparison of conditional models with standard models for key structures.
Abstract
In the theory of conditional sets, many classical theorems from areas such as functional analysis, probability theory or measure theory are lifted to a conditional framework, often to be applied in areas such as mathematical economics or optimization. The frequent experience that such theorems can be proved by `conditionalizations' of the classical proofs suggests that a general transfer principle is in the background, and that formulating and proving such a transfer principle would yield a wealth of useful further conditional versions of classical results, in addition to providing a uniform approach to the results already known. In this paper, we formulate and prove such a transfer principle based on second-order arithmetic, which, by the results of reverse mathematics, suffices for the bulk of classical mathematics, including real analysis, measure theory and countable algebra, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
