Author:
Moser Georg,Weiermann Andreas
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge Univeristy Press, 1998.
2. H. Bachmann. Transfinite Zahlen. Springer Verlag, 1955.
3. W. Buchholz. Proof-theoretical analysis of termination proofs. APAL, 75:57–65, 1995.
4. W. Buchholz. Ordinal notations and fundamental sequences. Unpublished manuscript; availabe at http://www.mathematik.uni-muenchen.de/~buchholz/ , 2003.
5. E.A. Cichon. Termination orderings and complexity characterisations. In P. Aczel, H. Simmons, and S.S. Wainer, editors, Proof Theory, pages 171–193, 1992.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Well Partial Orders;Outstanding Contributions to Logic;2024
2. On the Computational Content of Termination Proofs;Evolving Computability;2015
3. The Derivational Complexity Induced by the Dependency Pair Method;Logical Methods in Computer Science;2011-07-13
4. Multiply-Recursive Upper Bounds with Higman’s Lemma;Automata, Languages and Programming;2011
5. The Hydra battle and Cichon’s principle;Applicable Algebra in Engineering, Communication and Computing;2009-03-19