Author:
Krombholz Martin,Rathjen Michael
Publisher
Springer International Publishing
Reference14 articles.
1. Buchholz, W. (1986). A new system of proof-theoretic ordinals. Annals of Pure and Applied Logic, 32(1), 195–207.
2. Diestel, R. (2017). Graph theory. 5th ed. Springer.
3. Forster, T. (2003). Better-quasi-orderings and coinduction. Theoretical Computer Science, 309, 111–123.
4. Friedman, H., Robertson, N., & Seymour, P. (1987). Metamathematics of the graph minor theorem. In Logic and combinatorics. Ed. S. Simpson. Contemporary Mathematics 65. American Mathematical Society, pp. 229–261.
5. Krombholz, M. (2018). Proof theory of graph minors and tree embeddings. Ph.D. thesis. University of Leeds.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献