Lower bounds for increasing complexity of derivations after cut elimination-Reference-Cited by-同舟云学术

Lower bounds for increasing complexity of derivations after cut elimination

Published:1982-11 Issue:4 Volume:20 Page:2337-2350
ISSN:0090-4104
Container-title:Journal of Soviet Mathematics
language:en
Short-container-title:J Math Sci

Author:

Orevkov V. P.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,General Mathematics,Statistics and Probability,Applied Mathematics,General Mathematics,Statistics and Probability

Link

http://link.springer.com/content/pdf/10.1007/BF01629444.pdf

Reference11 articles.

1. G. S. Tseitin, “Complexity of a derivation in the prepositional calculus,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst. Akad. Nauk SSSR,8, 234–259 (1968).

2. Z. Galil, “On enumeration procedures for theorem proving and for integer programming,” in: Automata Languages and Programming, Edinburgh (1977), pp. 355–381.

3. R. Statman, “The predicate calculus is not a Kalmar elementary speed-up of the equation calculus,” Preprint, Cambridge (1975).

4. S. C. Kleene, Mathematical Logic, New York (1967).

5. G. Gentzen, “Untersuchungen über das logische Schliessen,” Math. Z.,39, 176–210, 405–433 (1934).

Cited by 44 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Consistency of PA and $$\varepsilon _0$$ Induction;Introduction to Incompleteness;2024

2. Herbrand complexity and the epsilon calculus with equality;Archive for Mathematical Logic;2023-07-29

3. The number of axioms;Annals of Pure and Applied Logic;2022-05

4. Andrews Skolemization May Shorten Resolution Proofs Non-elementarily;Logical Foundations of Computer Science;2021-12-16

5. Outline of the cut-elimination theorem;An Introduction to Proof Theory;2021-08-17