Skip to main content
Log in

Uniqueness of Normal Proofs in Implicational Intuitionistic Logic

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

Abstract

A minimal theorem in a logic L is an L-theorem which is not a non-trivial substitution instance of another L-theorem. Komori (1987) raised the question whether every minimal implicational theorem in intuitionistic logic has a unique normal proof in the natural deduction system NJ. The answer has been known to be partially positive and generally negative. It is shown here that a minimal implicational theorem A in intuitionistic logic has a unique β-normal proof in NJ whenever A is provable without non-prime contraction. The non-prime contraction rule in NJ is the implication introduction rule whose cancelled assumption differs from a propositional variable and appears more than once in the proof. Our result improves the known partial positive solutions to Komori's problem. Also, we present another simple example of a minimal implicational theorem in intuitionistic logic which does not have a unique βη-normal proof in NJ.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Aoto, T., 1995, “Unique normal proof property for implicational minimal formulas in the intuitionistic logic,” Research Report IS-RR-95-0015F, School of Information Science, JAIST.

  • Aoto, T. and Ono, H., 1994a, “Non-uniqueness of normal proofs for minimal formulas in implication-conjunction fragment of BCK,” Bulletin of the Section of Logic 23(3), 104–112.

    Google Scholar 

  • Aoto, T. and Ono, H., 1994b, “Uniqueness of normal proofs in {→, ∧}-fragment of NJ,” Research Report IS-RR-94-0024F, School of Information Science, JAIST.

  • Gentzen, G., 1934/1935, “Untersuchungen über das logische Schliessen,” Mathematische Zeitschrift 39, 176–405, 405-431.

    Google Scholar 

  • Hindley, J.R. and Seldin, J.P., 1986, Introduction to Combinators and ?-Calculus, London Mathematical Society Student Texts, Vol. 1, Cambridge: Cambridge University Press.

    Google Scholar 

  • Hirokawa, S., 1993, “Principal types of BCK-lambda-terms,” Theoretical Computer Science 107, 253–276.

    Google Scholar 

  • Ja?kowski, S., 1963, “Ñber Tautologien, in welchen keine Variable mehr als zweimal vorkommt,” Zeitschrift für mathematische Logik and Grundlagen der Mathematik 9, 219–228.

    Google Scholar 

  • Jay, C.B. and Ghani, N., 1995, “The virtue of eta-expansion,” Journal of Functional Programming 5(2), 135–154.

    Google Scholar 

  • Kashima, R., 1997, “Contraction-elimination for implicational logics,” Annals of Pure and Applied Logic 84, 17–39.

    Google Scholar 

  • Klop, J.W., 1992, “Term rewriting systems,” pp. 1–116 in Handbook of Logic in Computer Science, Vol. 2, S. Abramsky and D.M. Gabbay, and T.S.E. Maibaum, eds., Oxford: Oxford University Press.

    Google Scholar 

  • Komori, Y., 1987, “BCK algebras and lambda calculus,” pp. 5–11 in Proceedings of 10th Symposium on Semigroups, Sakado, 1986.

  • Komori, Y. and Hirokawa, S., 1993, “The number of proofs for a BCK-formula,” Journal of Symbolic Logic 58(2), 626–628.

    Google Scholar 

  • MacLane, S., 1982, “Why commutative diagrams coincide with equivalent proofs,” Contemporary Mathematics 13, 387–401.

    Google Scholar 

  • Mints, G.E., 1979, “A coherence theorem for cartesian closed categories (abstract),” Journal of Symbolic Logic 44(3), 453–454.

    Google Scholar 

  • Mints, G.E., 1992, “A simple proof of the coherence theorem for Cartesian closed categories,” pp. 213–220 in Selected Papers in Proof Theory, G.E. Mints, ed., Napoli: Bibliopolis.

    Google Scholar 

  • Ono, H., 1990, “Structural rules and a logical hierarchy,” pp. 95–104 in Mathematical Logic, P.P. Petkov, ed., New York: Plenum Press.

    Google Scholar 

  • Prawitz, D., 1965, Natural Deduction, A Proof-Theoretical Study, Acta Universitatis Stockholmiensis Stockholm Studies in Philosophy, Vol. 3, Stockholm: Almqvist & Wiksell.

    Google Scholar 

  • Takeuti, G., 1987, Proof Theory, second edition, Studies in Logic and the Foundations of Mathematics, Vol. 81, Amsterdam: North-Holland.

    Google Scholar 

  • Tatsuta, M., 1993, “Uniqueness of normal proofs of minimal formulas,” Journal of Symbolic Logic 58(3), 789–799.

    Google Scholar 

  • Van Benthem, J., 1995, Language in Action: Categories, Lambdas, and Dynamic Logic, Cambridge, MA: The MIT Press.

    Google Scholar 

  • Van Dalen, D., 1994, Logic and Structure, third edition, Berlin: Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aoto, T. Uniqueness of Normal Proofs in Implicational Intuitionistic Logic. Journal of Logic, Language and Information 8, 217–242 (1999). https://doi.org/10.1023/A:1008254111992

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008254111992

Navigation