2000 character limit reached
Epsilon Calculus Provides Shorter Cut-Free Proofs
Published 17 Jan 2024 in math.LO | (2401.09183v1)
Abstract: In this paper we show that cut-free derivations in the epsilon format of sequent calculus provide for a non-elementary speed-up w.r.t. cut-free proofs in usual sequent calculi in first-order language.
- Unsound inferences make proofs shorter. J. Symb. Log., 84(1):102–122, 2019.
- On skolemization and proof complexity. Fundam. Informaticae, 20(4):353–379, 1994.
- Methods of Cut-elimination, volume 34. Springer Science & Business Media, 2011.
- Effective skolemization. In WoLLIC, volume 13923 of Lecture Notes in Computer Science, pages 69–82. Springer, 2023.
- Grundlagen der Mathematik. 2, 1939.
- The epsilon calculus and Herbrand complexity. Studia Logica, 82(1):133–155, 2006.
- Vladimir P Orevkov. Lower bounds for increasing complexity of derivations after cut elimination. Journal of Soviet Mathematics, 20:2337–2350, 1982.
- Richard Statman. Lower bounds on herbrand’s theorem. Proceedings of the American Mathematical Society, 75(1):104–107, 1979.
- Daniel Weller. On the elimination of quantifier-free cuts. Theor. Comput. Sci., 412(49):6843–6854, 2011.
Paper Prompts
Sign up for free to create and run prompts on this paper.