Skip to main content
SpringerLink
Log in

Herbrand's theorem and term induction

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract.

We study the formal first order system TIND in the standard language of Gentzen's LK . TIND extends LK by the purely logical rule of term-induction, that is a restricted induction principle, deriving numerals instead of arbitrary terms. This rule may be conceived as the logical image of full induction.

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

Access this article

Log in via an institution

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

  1. Baader, F., Snyder, W.: Unification Theory. Vol. I. Elsevier Science Publisher, 2001, pp. 445–532

  2. Baaz, M.: Über den allgemeinen Gehalt von Beweisen. In: Contributions to General Algebra 6, Hölder-Pichler-Tempsky, Teubner, 1988, pp. 21–29

  3. Baaz, M., Fermüller, C.: A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity. In: Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7–12, 2001, Proceedings, Springer Verlag, 2001, pp. 38–48

  4. Baaz, M., Leitsch, A.: On Skolemization and Proof Complexity. Fund. Informaticae 20 (4), 353–379 (1994)

    MathSciNet  Google Scholar 

  5. Baaz, M., Leitsch, A.: Cut Elimination by Resolution. J. Symb. Comp. (1999)

  6. Baaz, M., Leitsch, A.: Cut Normal Forms and Proof Complexity. Ann. Pure Appl. Logic 97, 127–177 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Baaz, M., Leitsch, A., Moser, G.: System Description: CutRes 0.1: Cut Elimination by Resolution. In: Proc. of CADE'99, 1999, pp. 212–216

  8. Baaz, M., Pudlák, P.: Kreisel's conjecture for L∃1. In: P. Clote and J. Krajíćek (eds), Arithmetic, Proof Theory and Computational Complexity, Oxford University, 1993, pp. 29–59. With a postscript by G. Kreisel

  9. Baaz, M., Wojtylak, P.: Generalizing Proofs in Monadic Languages. With a postscript by G. Kreisel, submitted to Ann. Pure Appl. Logic, 2001

  10. Baaz, M., Zach, R.: Generalizing Theorems in Real Closed Fields. Ann. Pure Appl. Logic 75, 3–23 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  11. Boerger, E., Graedel, E., Gurevich, Y.: The Classical Decision Problem. Springer-Verlag, 1997

  12. Boyer, R.S., Moore, J.S.: A Computational Logic Handbook. Academia Press, 1988

  13. Bundy, A.: The Automation of Proof by Mathematical Induction. In: A. Robinson and A. Voronkov, (eds), Handbook of Automated Reasoning, Vol. I, chapter 13, Elsevier Science, 2001, pp. 845–911

  14. Buss, S.R.: An Introduction to Proof Theory. In: S.R. Buss, (ed), Handbook of Proof Theory, Elsevier Science, 1998, pp. 1–79

  15. Farmer, W.M.: Length of Proofs and Unification Theory. PhD thesis, University of Wisconsin-Madison, Madison, Wisconsin, 1984

  16. Gentzen, G.: Untersuchungen über das logische Schließ en I–II. Mathematische Zeitschrift, 39, 176–210, 405–431 (1934)

    Article  MATH  MathSciNet  Google Scholar 

  17. Gentzen, G.: Neue Fassung des Widerspruchsfreiheitsbeweises für die reine Zahlentheorie. Forschungen zur Logik und zur Grundlegung der exakten Wissenschaften, 4, 1938

  18. Gericke, H.: Mathematik in Antike und Orient. Springer Verlag, 1984

  19. Herbrand, J.: Jacques Herbrand: Logical Writings. D. Reidel Publishing Company, Holland, 1971

  20. Hilbert, D., Bernays, P.: Grundlagen der Mathematik 2. Spinger Verlag, 1970

  21. Krajíćek, J., Pudlák, P.: The Number of Proof Lines and the Size of Proofs in First-Order Logic. Arch. Math. Logic 27, 69–84 (1988)

    Article  MathSciNet  Google Scholar 

  22. Kröger, F.: Temporal Logics of Programs. Springer Verlag, 1985

  23. Moser, G.: Term Induction. PhD thesis, Vienna University of Technology, June 2001

  24. Parikh, R.J.: Some Results on the Length of Proofs. Trans. Amer. Math. Soc. 1973, pp. 29–36

  25. Pudlak, P.: The Lengths of Proofs. In: S. Buss, (ed), Handbook of Proof Theory, Elsevier, 1998, pp. 547–639

  26. Richardson, D.: Sets of theorems with short proofs. J. Symb. Logic 39 (2), 235–242 (1974)

    Article  Google Scholar 

  27. Schütte, K.: Proof Theory. Springer, Berlin and New York, 1977

  28. Takeuti, G.: Proof Theory. North-Holland, Amsterdam, 2nd edition, 1987

  29. Walther, C.: Mathematical Induction, Vol. 12, Oxford University Press, 1994, pp. 122–227

  30. Yukami, T.: Some Results on Speed-up. Ann. Japan Assoc. Philos. Sci. 6, 195–205 (1984)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Diskrete Mathematik und Geometrie, Vienna University of Technology, E104, Wiedner Hauptstrasse 8–10, Austria

    Matthias Baaz

  2. Computational Logic, University of Innsbruck, Technikerstrasse 21a, Austria

    Georg Moser

Authors
  1. Matthias Baaz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Georg Moser
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Georg Moser.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baaz, M., Moser, G. Herbrand's theorem and term induction. Arch. Math. Logic 45, 447–503 (2006). https://doi.org/10.1007/s00153-005-0327-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-005-0327-6

Mathematics Subject Classification (2000)

Key words or phrases

Search

Navigation