constructive reverse mathematics

constructive reverse mathematics
Name	constructive reverse mathematics
Field	Mathematical logic
Introduced	1980s
Founder	Errett Bishop; Rodney G. Downey
Notable people	Errett Bishop; Douglas S. Bridges; Wim Veldman; Troelstra; D. R. Bridges; Ulrich Kohlenbach

constructive reverse mathematics

Constructive reverse mathematics studies which constructive principles are necessary and sufficient to prove theorems within constructive frameworks, relating constructive axioms to theorems much like reverse mathematics does classically. It situates constructive systems relative to one another by extracting equivalences between constructive versions of classical theorems and intuitionistic or constructive axioms, engaging with debates originating in foundational exchanges involving Errett Bishop, L. E. J. Brouwer, and developments linked to Kurt Gödel's interpretations and Alonzo Church's lambda calculus. The subject draws on techniques and institutions associated with Université de Paris, University of Cambridge, University of Oxford, Cornell University, and research programs at Institute for Advanced Study.

Introduction

Constructive reverse mathematics arose as a response to both classical reverse mathematics initiated at Harvard University and constructive programmatic work by Errett Bishop in Constructive analysis. It concerns equivalences among constructive principles such as forms of choice and continuity, locating results within frameworks like intuitionistic logic and systems influenced by Brouwerian principles. The field intersects with research by scholars affiliated with University of Birmingham, Vrije Universiteit Amsterdam, Kobe University, and labs at Microsoft Research and University of Chicago.

Foundations and Logical Principles

The foundations rely on formal frameworks that avoid classical axioms like the Law of excluded middle and the Axiom of choice in its full classical form, instead considering weaker constructive variants such as countable choice and dependent choice studied by researchers connected to Royal Society circles. Key logical principles include versions of continuity principles rooted in Brouwer, realizability interpretations associated with Stephen Kleene, and interpretations related to Gödel's Dialectica interpretation developed at Princeton University. Foundational frameworks often reference work from Institut Henri Poincaré and debates involving Luitzen Egbertus Jan Brouwer and followers in the Royal Academy of Sciences.

Main Systems and Subsystems

Main systems used include formalizations inspired by Heyting arithmetic and systems akin to constructive set theories influenced by Erwin Engeler and research groups at University of Amsterdam. Subsystems mirror classical reverse mathematics' base systems like RCA_0 but in constructive guise, with counterparts studied at University of Nijmegen and University of Leeds. Other notable systems are typed lambda calculi with constructive axioms influenced by work at Carnegie Mellon University and proof-theoretic frameworks linked to Institute for Logic, Language and Computation.

Key Results and Equivalences

Key equivalences link constructive principles to constructive theorems such as versions of the intermediate value theorem, compactness theorems, and fixed-point results analogous to those analyzed by scholars at University of Minnesota and University of California, Berkeley. Results establish that certain constructive continuity principles are equivalent to compactness statements in constructive analysis, paralleling investigations connected to Bishop's constructive mathematics and studies undertaken at University of Cambridge seminars. Equivalences often reference principles related to Markov's principle and variants of choice that have been subject to analysis at IHÉS and workshops at Fields Institute.

Methods and Proof Techniques

Methods include realizability techniques pioneered by Stephen Cole Kleene and adaptations of proof mining methods associated with Ulrich Kohlenbach at Technische Universität Darmstadt, as well as model constructions drawing on work from Dana Scott and Per Martin-Löf at Lund University. Techniques use constructive countermodels, continuity arguments rooted in Brouwerian continuity, and program extraction methods developed in collaborations involving Carnegie Mellon University and École Normale Supérieure researchers.

Applications and Connections

Applications connect to constructive analysis, computable analysis, and areas influenced by constructive methodologies explored at IBM Research and Microsoft Research. Connections span to type theory work at University of Edinburgh and proof assistants such as those developed at Inria and University of Cambridge. Interactions occur with classical reverse mathematics research at Cornell University and with constructivist traditions linked to University of Toronto and McMaster University.

Historical Development and Contributors

The historical arc runs from foundational debates involving L. E. J. Brouwer and Errett Bishop through later formalizations by researchers such as Douglas S. Bridges and Wim Veldman and contemporary contributors including Ulrich Kohlenbach and scholars associated with Royal Holloway, University of London. The field has been shaped by conferences and workshops at institutions like Fields Institute, Simons Institute, and Institut Mittag-Leffler, with influential publications emerging from presses tied to Cambridge University Press and Oxford University Press.

Category:Mathematical logic