Cut-Simulation in Impredicative Logics

  • Christoph E. Benzmüller
  • Chad E. Brown
  • Michael Kohlhase
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4130)


We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic — in our case a sequent calculus for classical type theory — is like adding cut. The phenomenon equally applies to prominent axioms like Boolean- and functional extensionality, induction, choice, and description. This calls for the development of calculi where these principles are built-in instead of being treated axiomatically.


Sequent Calculus Proof Step Extensionality Axiom Functional Extensionality Comprehension Principle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Andrews, P.B.: Resolution in type theory. Journal of Symbolic Logic 36(3), 414–432 (1971)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Andrews, P.B.: General models and extensionality. Journal of Symbolic Logic 37(2), 395–397 (1972)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Andrews, P.B.: An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, 2nd edn. Kluwer Academic Publishers, Dordrecht (2002)MATHGoogle Scholar
  4. 4.
    Benzmüller, C.E.: Equality and Extensionality in Automated Higher-Order Theorem Proving. PhD thesis, Saarland University (1999)Google Scholar
  5. 5.
    Benzmüller, C.E., Brown, C.E., Kohlhase, M.: Higher-order semantics and extensionality. Journal of Symbolic Logic 69(4), 1027–1088 (2004)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Benzmüller, C.E., Brown, C.E., Kohlhase, M.: Semantic techniques for higher-order cut-elimination. Seki Report SR-2004-07, Saarland University (2004)Google Scholar
  7. 7.
    Benzmüller, C.E., Brown, C.E., Kohlhase, M.: Cut-simulation in impredicative logics (extended version). Seki Report SR-2006-01, Saarland University (2006)Google Scholar
  8. 8.
    Brown, C.E.: Set Comprehension in Church’s Type Theory. PhD thesis, Department of Mathematical Sciences, Carnegie Mellon University (2004)Google Scholar
  9. 9.
    Church, A.: A formulation of the simple theory of types. Journal of Symbolic Logic 5, 56–68 (1940)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Hintikka, K.J.J.: Form and content in quantification theory. Acta Philosophica Fennica 8, 7–55 (1955)MathSciNetGoogle Scholar
  11. 11.
    Huet, G.P.: A mechanization of type theory. In: Proceedings of the 3rd International Joint Conference on Artificial Intelligence, pp. 139–146 (1973)Google Scholar
  12. 12.
    Russell, B.: Mathematical logic as based on the theory of types. American Journal of Mathematics 30, 222–262 (1908)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Smullyan, R.M.: A unifying principle for quantification theory. Proc. Nat. Acad Sciences 49, 828–832 (1963)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Smullyan, R.M.: First-Order Logic. Springer, Heidelberg (1968)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Christoph E. Benzmüller
    • 1
  • Chad E. Brown
    • 1
  • Michael Kohlhase
    • 2
  1. 1.Saarland UniversitySaarbrückenGermany
  2. 2.International University BremenBremenGermany

Personalised recommendations