Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference14 articles.
1. Cichon, E. A.1983, A short proof of two recently discovered independence results using recursion theoretic methods, inProceedings of the American Mathematical Society, Vol. 97, pp. 704–706, Amer. Math. Soc. Providence, RI.
2. Ordinal recursive bounds for Higman's theorem;Cichon;Theoret. Comput. Sci.,1998
3. Well-partial orderings and hierarchies;De Jongh;Indag. Math.,1977
4. Orderings for term rewriting systems;Dershowitz;Theoret. Comput. Sci.,1982
5. Dershowitz, N, and, Jouannaud, J. P. 1990, Rewrite systems, in, Handbook of Theoretical Computer Science, Vol, B, North-Holland, Amsterdam.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Well Partial Orders;Outstanding Contributions to Logic;2024
2. Higman’s Lemma and Its Computational Content;Advances in Proof Theory;2016
3. KBOs, ordinals, subrecursive hierarchies and all that;Journal of Logic and Computation;2014-12-03
4. Multiply-Recursive Upper Bounds with Higman’s Lemma;Automata, Languages and Programming;2011
5. Binary Trees and (Maximal) Order Types;Lecture Notes in Computer Science;2007