A Mechanised and Constructive Reverse Analysis of Soundness and Completeness of Bi-intuitionistic Logic-Reference-Cited by-同舟云学术

A Mechanised and Constructive Reverse Analysis of Soundness and Completeness of Bi-intuitionistic Logic

Published:2024-01-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs
language:
Short-container-title:

Author:

Shillito Ian¹,Kirst Dominik²

Affiliation:

1. Australian National University, Canberra, Australia

2. Ben-Gurion University of the Negev, Beer-Sheva, Israel

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3636501.3636957

Reference49 articles.

1. First steps in synthetic computability theory;Bauer Andrej;Electronic Notes in Theoretical Computer Science,2006

2. Thierry Coquand and Gérard Huet. 1986. The calculus of constructions. Ph. D. Dissertation. INRIA. Thierry Coquand and Gérard Huet. 1986. The calculus of constructions. Ph. D. Dissertation. INRIA.

3. Bishop-Style Constructive Reverse Mathematics

4. Christian Doczkal and Joachim Bard . 2018. Completeness and Decidability of Converse PDL in the Constructive Type Theory of Coq . In Certified Programs and Proofs. Los Angeles , United States . https://hal.science/hal-01646782 Christian Doczkal and Joachim Bard. 2018. Completeness and Decidability of Converse PDL in the Constructive Type Theory of Coq. In Certified Programs and Proofs. Los Angeles, United States. https://hal.science/hal-01646782

5. Christian Doczkal and Gert Smolka . 2014. Completeness and Decidability Results for CTL in Coq . In Interactive Theorem Proving, Gerwin Klein and Ruben Gamboa (Eds.). Springer International Publishing , Cham . 226–241. isbn:978-3-319-08970-6 Christian Doczkal and Gert Smolka. 2014. Completeness and Decidability Results for CTL in Coq. In Interactive Theorem Proving, Gerwin Klein and Ruben Gamboa (Eds.). Springer International Publishing, Cham. 226–241. isbn:978-3-319-08970-6