Author:
Ebner Gabriel,Hetzl Stefan,Reis Giselle,Riener Martin,Wolfsteiner Simon,Zivota Sebastian
Publisher
Springer International Publishing
Reference21 articles.
1. Andrews, P.B.: Resolution in type theory. J. Symbolic Log. 36(3), 414–432 (1971). doi:
10.2307/2269949
2. Baaz, M., Hetzl, S., Leitsch, A., Richter, C., Spohr, H.: CERES: an analysis of fürstenberg’s proof of the infinity of primes. Theoret. Comput. Sci. 403(2–3), 160–175 (2008)
3. Baaz, M., Leitsch, A.: Cut-elimination and redundancy-elimination by resolution. J. Symbolic Comput. 29(2), 149–176 (2000)
4. Boespflug, M., Carbonneaux, Q., Hermant, O.: The
$$\lambda {\Pi }$$
-calculus modulo as a universal proof language. In: Pichardie, D., Weber, T. (eds.) Proceedings of PxTP2012: Proof Exchange for Theorem Proving, pp. 28–43 (2012)
5. Dunchev, C., Leitsch, A., Libal, T., Riener, M., Rukhaia, M., Weller, D., Paleo, B.W.: PROOFTOOL: a GUI for the GAPT framework. In: Kaliszyk, C., Lüth, C. (eds.) Proceedings 10th International Workshop on User Interfaces for Theorem Provers (UITP) 2012, EPTCS, vol. 118, pp. 1–14 (2012)
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Interactive Theorem Proving for Logic and Information;Studies in Computational Intelligence;2021-11-02
2. Facilitating Meta-Theory Reasoning (Invited Paper);Electronic Proceedings in Theoretical Computer Science;2021-07-16
3. A Calculus of Tracking: Theory and Practice;Proceedings on Privacy Enhancing Technologies;2021-01-29
4. The nanoCoP 2.0 Connection Provers for Classical, Intuitionistic and Modal Logics;Lecture Notes in Computer Science;2021
5. Expansion trees with cut;Mathematical Structures in Computer Science;2019-09