Intuitionistic Propositional Logic in Lean

Dafina Trufaş

In this paper we present a formalization of Intuitionistic Propositional Logic in the Lean proof assistant. Our approach focuses on verifying two completeness proofs for the studied logical system, as well as exploring the relation between the two analyzed semantical paradigms - Kripke and algebraic. In addition, we prove a large number of theorems and derived deduction rules.

In Mircea Marin and Laurenţiu Leuştean: Proceedings Eighth Symposium on Working Formal Methods (FROM 2024), Timişoara, Romania, September 16-18, Electronic Proceedings in Theoretical Computer Science 410, pp. 133–149.
Published: 31st October 2024.

ArXived at: https://dx.doi.org/10.4204/EPTCS.410.9 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org