DeepAI AI Chat
Log In Sign Up

Constructive Analysis in the Agda Proof Assistant

by   Zachary Murray, et al.

Proof assistant software has recently been used to verify proofs of major theorems, yet even the libraries of some of the most prominent proof assistants lack much of undergraduate mathematics. In particular, the Agda proof assistant has no formalization of the real numbers and their arithmetic. In this thesis, I present my implementation of Errett Bishop's constructive real numbers in Agda, including their arithmetic, ordering, and fundamental results, such as uncountability and Cauchy completeness. We will also survey the basic concepts of constructive analysis and the Agda proof assistant.


(Seemingly) Impossible Theorems in Constructive Mathematics

We prove some constructive results that on first and maybe even on secon...

On the Constructive Truth and Falsity in Peano Arithmetic

Recently, Artemov [4] offered the notion of constructive consistency for...

Formalizing π_4(𝕊^3) ≅ℤ/2ℤ and Computing a Brunerie Number in Cubical Agda

Brunerie's 2016 PhD thesis contains the first synthetic proof in Homotop...

An Analysis of Tennenbaum's Theorem in Constructive Type Theory

Tennenbaum's theorem states that the only countable model of Peano arith...

Nonexistence of a Universal Algorithm for Traveling Salesman Problems in Constructive Mathematics

Proposed initially from a practical circumstance, the traveling salesman...

Concurrent Gaussian elimination

Working in a semi-constructive logical system that supports the extracti...

Towards platform-independent specification and verification of the standard trigonometry functions

Research project "Platform-independent approach to formal specification ...