Abstract
Consistency is a key property of any logical system. However, proofs of consistency usually rely on heavy proof theory notions like admissibility of cut. A more semantics-based approach to consistency proofs explores the correspondence between a logic and its relationship with the evaluation in a λ-calculus, known as Curry-Howard isomorphism. In this work, we present a comparison between two formalizations of consistency for minimal propositional logic: one using a semantic-based approach and another following the (traditional) syntactic, proof-theoretical approach in both Coq proof assistant and Agda programming language. We conclude by discussing the lessons learned during the cerfication of these results in both languages.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
