Reverse mathematics and uniformity in proofs without excluded middle

DOI10.1215/00294527-1306163zbMath1225.03083arXiv1010.5165OpenAlexW2089230867WikidataQ57951149 ScholiaQ57951149MaRDI QIDQ540402

Jeffry L. Hirst, Carl Mummert

Publication date: 3 June 2011

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.5165

zbMATH Keywords

uniformizationproof theoryrealizabilityreverse mathematicsintuitionistic arithmeticsubsystems of second-order arithmetic

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Metamathematics of constructive systems (03F50)

Related Items (10)

Reverse mathematics and Weihrauch analysis motivated by finite complexity theory ⋮ Intuitionistic Provability versus Uniform Provability in $$\mathsf{RCA}$$ ⋮ ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS ⋮ Classical consequences of continuous choice principles from intuitionistic analysis ⋮ On the strength of marriage theorems and uniformity ⋮ Using Ramsey's theorem once ⋮ Pincherle's theorem in reverse mathematics and computability theory ⋮ Weihrauch and constructive reducibility between existence statements ⋮ Classical provability of uniform versions and intuitionistic provability ⋮ Parallelizations in Weihrauch reducibility and constructive reverse mathematics

This page was built for publication: Reverse mathematics and uniformity in proofs without excluded middle