A Comprehensive Formalization of Propositional Logic in Coq: Deduction Systems, Meta-Theorems, and Automation Tactics

Dakai Guo, Wensheng Yu

Open source

DOI
10.3390/math11112504
Published
2023-05-29
Container
Mathematics
Publisher
MDPI AG
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.3390/math11112504,
  title = {A Comprehensive Formalization of Propositional Logic in Coq: Deduction Systems, Meta-Theorems, and Automation Tactics},
  author = {Dakai Guo and Wensheng Yu},
  year = {2023},
  journal = {Mathematics},
  doi = {10.3390/math11112504},
  url = {https://doi.org/10.3390/math11112504}
}

RIS

TY  - JOUR
TI  - A Comprehensive Formalization of Propositional Logic in Coq: Deduction Systems, Meta-Theorems, and Automation Tactics
AU  - Dakai Guo
AU  - Wensheng Yu
PY  - 2023
JO  - Mathematics
DO  - 10.3390/math11112504
UR  - https://doi.org/10.3390/math11112504
ER  - 

APA

Guo, D., & Yu, W. (2023). A Comprehensive Formalization of Propositional Logic in Coq: Deduction Systems, Meta-Theorems, and Automation Tactics. Mathematics. https://doi.org/10.3390/math11112504

Source records