Publisher
Springer International Publishing
Reference67 articles.
1. Blass, A., & Gurevich, Y. (2008). Program termination and well partial orderings. ACM Transactions on Computational Logic, 9(3), Art. 18, 26.
2. Bonnet, R. (1975). On the cardinality of the set of initial intervals of a partially ordered set. In Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), Vol. I, pp. 189–198. Colloq. Math. Soc. János Bolyai, Vol. 10. North-Holland, Amsterdam.
3. Cholak, P., Marcone, A., & Solomon, R. (2004). Reverse mathematics and the equivalence of definitions for well and better quasi-orders. The Journal of Symbolic Logic, 69(3), 683–712.
4. Clote, P. (1990). The metamathematics of Fraïssé’s order type conjecture. In K. Ambos-Spies, G. H. Müller, & G. E. Sacks (Eds.), Recursion theory week (pp. 41–56). Berlin: Springer.
5. Dean, W., & Walsh, S. (2017). The prehistory of the subsystems of second-order arithmetic. Review of Symbolic Logic, 10(2), 357–396.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献