Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Andrews, P.B.: Theorem Proving via General Matings. Journal of the ACM 28(2), 193–214 (1981)
2. Cambridge Tracts in Theoretical Computer Science;A. Asperti,1998
3. Baader, F., Snyder, W.: Unification Theory. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 445–533. Elsevier, Amsterdam (2001)
4. Baaz, M., Hetzl, S.: On the non-confluence of cut-elimination. To appear in the Journal of Symbolic Logic (preprint),
http://www.logic.at/people/hetzl/
5. Baaz, M., Hetzl, S., Leitsch, A., Richter, C., Spohr, H.: CERES: An Analysis of Fürstenberg’s Proof of the Infinity of Primes. Theoretical Computer Science 403(2-3), 160–175 (2008)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献