Formalizing Implicative Algebras in Coq
Author: Étienne Miquey
Paper Information
Title: | Formalizing Implicative Algebras in Coq |
Authors: | Étienne Miquey |
Proceedings: | ITP Papers |
Editors: | Jeremy Avigad and Assia Mahboubi |
Keywords: | Coq, implicative algebras, classical realizability, complete lattices, tripos |
Abstract: | ABSTRACT. We present a Coq formalization of Alexandre Miquel’s implicative algebras, which aim at providing a general algebraic framework for the study of classical realizability models. We first give a self-contained presentation of the underlying implicative structures, which roughly consists of a complete lattice equipped with a binary law representing the implication. We then explain how these structures can be turned into models by adding separators, giving rise to the so-called implicative algebras. Additionally, we show how they generalize Boolean and Heyting algebras as well as the usual algebraic structures used in the analysis of classical realizability. |
Pages: | 18 |
Talk: | Jul 09 14:00 (Session 49C) |
Paper: |