The monotone completeness theorem in constructive reverse mathematics Invited Presentation at Seventh International Conference on Computability and Complexity in Analysis (2010)
Attributed to:
WORKSHOP: LEEDS SYMPOSIUM ON PROOF THEORY & CONSTRUCTIVISM
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.4204/eptcs.24.5
Publication URI: http://dx.doi.org/10.4204/eptcs.24.5
Type: Journal Article/Review
Parent Publication: Electronic Proceedings in Theoretical Computer Science