Computer Science – Logic in Computer Science
Scientific paper
2011-04-03
Computer Science
Logic in Computer Science
3 page extended abstract, 1 figure, extended version of abstact for ARW 2011
Scientific paper
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.
No associations
LandOfFree
Proof-Theoretic Soundness and Completeness does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Proof-Theoretic Soundness and Completeness, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proof-Theoretic Soundness and Completeness will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-131887