Publisher
Springer International Publishing
Reference9 articles.
1. Aguilera, J.P., Baaz, M.: Unsound inferences make proofs shorter. CoRR, abs/1608.07703 (2016)
2. Symbolic Computation (Artificial Intelligence);PB Andrews,1971
3. Andrews, P.B.: Theorem proving via general matings. J. ACM (JACM) 28(2), 193–214 (1981)
4. Baaz, M., Hetzl, S., Weller, D.: On the complexity of proof deskolemization. J. Symbolic Logic 77(2), 669–686 (2012)
5. Baaz, M., Leitsch, A.: On skolemization and proof complexity. Fundamenta Informaticae 20(4), 353–379 (1994)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Non-Elementary Compression of First-Order Proofs in Deep Inference Using Epsilon-Terms;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Herbrand complexity and the epsilon calculus with equality;Archive for Mathematical Logic;2023-07-29
3. A SIMPLIFIED PROOF OF THE EPSILON THEOREMS;The Review of Symbolic Logic;2023-07-10
4. EPSILON THEOREMS IN INTERMEDIATE LOGICS;The Journal of Symbolic Logic;2022-01-10