Demonstrates uniqueness of D-normal proofs in logic, suggesting implications for proof structures.
This paper presents the notion of D-normal proofs, which is defined syntactically and gives one of the weakest condition for uniqueness of normal proofs. This paper proves the following results: (1) beta eta D-normal proofs of a formula are unique. (2) A beta-normal proof of a PNN-formula is D-normal. (3) A beta-normal proof of a minimal formula in BCK logic is D-normal. These results give other proofs of uniqueness of beta eta-normal proofs of a PNN-formula, and uniqueness of beta eta-normal proofs of a minimal formula in BCK logic.
No takes yet. Share an insight, caveat, or question.
Makoto Tatsuta (2006) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: