Skip to main content
×
Home
    • Aa
    • Aa

Classical mathematics for a constructive world

  • RUSSELL O'CONNOR (a1)
  • DOI: http://dx.doi.org/10.1017/S0960129511000132
  • Published online: 01 July 2011
Abstract

Interactive theorem provers based on dependent type theory have the flexibility to support both constructive and classical reasoning. Constructive reasoning is supported natively by dependent type theory, and classical reasoning is typically supported by adding additional non-constructive axioms. However, there is another perspective that views constructive logic as an extension of classical logic. This paper will illustrate how classical reasoning can be supported in a practical manner inside dependent type theory without additional axioms. We will show several examples of how classical results can be applied to constructive mathematics. Finally, we will show how to extend this perspective from logic to mathematics by representing classical function spaces using a weak value monad.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

T. Altenkirch , C. McBride and W. Swierstra (2007) Observational equality, now! In: PLPV '07 Proceedings of the 2007 workshop on Programming languages meets program verification, ACM5768.

H. Barendregt and H. Geuvers (2001) Proof-assistants using dependent type systems. In: A. Robinson and A. Voronkov (eds.) Handbook of Automated Reasoning 2, Elsevier Science Publishers11491238.

H. Geuvers , A. Koprowski , D. Synek and E. van der Weegen (2010) Automated machine-checked hybrid system safety proofs. In: M. Kaufmann and L. Paulson (eds.) Proceedings Interactive Theorem Proving, ITP 2010. Springer-Verlag Lecture Notes in Computer Science6172259274.

A. Kock (1972) Strong functors and monoidal monads. Archiv der Mathematik 23 113120.

R. Mines , F. Richman and W. Ruitenburg (1988) A Course in Constructive Algebra, Springer-Verlag.

R. O'Connor (2008a) Certified exact transcendental real number computation in Coq. In: O. A. Mohamed , C. Muñoz and S. Tahar (eds.) Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2008). Springer-Verlag Lecture Notes in Computer Science5170246261.

S. G. Simpson (1999) Subsystems of second order arithmetic, Perspectives in Mathematical Logic, Springer-Verlag.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×