Author:
Peuter Dennis,Sofronie-Stokkermans Viorica
Publisher
Springer International Publishing
Reference42 articles.
1. Abdulaziz, M., Mehlhorn, K., Nipkow, T.: Trustworthy graph algorithms (invited talk). In: Rossmanith, P., Heggernes, P., Katoen, J. (eds.) Proceedings 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), volume 138 of LIPIcs, pp. 1:1–1:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
2. Ackermann, W.: Untersuchungen über das Eliminationsproblem der mathematischen Logik. Mathematische Annalen 110, 390–413 (1935)
3. Ackermann, W.: Zum Eliminationsproblem der mathematischen Logik. Mathematische Annalen 111, 61–63 (1935)
4. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);F Alberti,2013
5. Bachmair, L., Ganzinger, H., Waldmann, U.: Refutational theorem proving for hierarchic first-order theories. Appl. Algebra Eng. Commun. Comput. 5, 193–212 (1994)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献