Proof-Theoretic Soundness and Completeness
Logic in Computer Science
2022-04-28 v4 Logic
Abstract
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a proof-theoretic soundness and completeness proof, which we believe is conducive to automation.
Keywords
Cite
@article{arxiv.1104.0379,
title = {Proof-Theoretic Soundness and Completeness},
author = {Robert Rothenberg},
journal= {arXiv preprint arXiv:1104.0379},
year = {2022}
}
Comments
The proofs are flawed