2000 character limit reached
Proof-Theoretic Soundness and Completeness
Published 3 Apr 2011 in cs.LO and math.LO | (1104.0379v4)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.