没有前件推理的证明：组合学和割消的复杂性介绍
Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination
摘要：
本文的目的是提供一个介绍削减消除，这是一个广泛的数学观众。根岑的割消定理并不像它应有的那样广为人知，它与许多有趣的数学结构联系在一起。特别是，我们试图表明一些动态和组合方面的削减消除，以及其连接到复杂性理论。我们讨论了两个具体的例子，其中一个可以看到的结构与削减，一个关于可行的数字和其他有关“有界平均振荡”从实分析的简短证明。
英文摘要：
This paper is intended to provide an introduction to cut elimination which is accessible to a broad mathematical audience. Gentzen's cut elimination theorem is not as well known as it deserves to be, and it is tied to a lot of interesting mathematical structure. In particular we try to indicate some dynamical and combinatorial aspects of cut elimination, as well as its connections to complexity theory. We discuss two concrete examples where one can see the structure of short proofs with cuts, one concerning feasible numbers and the other concerning "bounded mean oscillation" from real analysis.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
