First-order natural deduction in Agda
Logic
2021-04-12 v1 Logic in Computer Science
Abstract
Agda is a dependently-typed functional programming language, based on an extension of intuitionistic Martin-L\"of type theory. We implement first order natural deduction in Agda. We use Agda's type checker to verify the correctness of natural deduction proofs, and also prove properties of natural deduction, using Agda's proof assistant functionality. This implementation corresponds to a formalisation of natural deduction in constructive type theory, and the proofs are verified by Agda to be correct (under the assumption that Agda itself is correct).
Cite
@article{arxiv.2104.04095,
title = {First-order natural deduction in Agda},
author = {Louis Warren},
journal= {arXiv preprint arXiv:2104.04095},
year = {2021}
}