by Evgeny Ivashkevich
This project is focused on the formalization of some elementary mathematical theories in Coq and is intended as a compagnion to the lecture course on math formalizations and certified programming:
- Sort function as a demonstration of certified programming style
- Propositional algebra and calculus, their soundness and completeness
- Untyped lambda calculus
- Constructive axiomatics for plane Euclidean geometry (https://arxiv.org/abs/1903.05175)
- Hughes algorithm for list reverse function
- Example of Goedel's Incompleteness Theorem