Termination
- 1 January 1985
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 180-224
- https://doi.org/10.1007/3-540-15976-2_9
Abstract
No abstract availableKeywords
This publication has 41 references indexed in Scilit:
- On the study data structures: Binary tournaments with repeated keysPublished by Springer Nature ,2006
- Mathematical GamesScientific American, 1983
- Operational and Semantic Equivalence Between Recursive ProgramsJournal of the ACM, 1980
- A note on simplification orderingsInformation Processing Letters, 1979
- TREES AND BALL GAMESAnnals of the New York Academy of Sciences, 1979
- Tree-Manipulating Systems and Church-Rosser TheoremsJournal of the ACM, 1973
- The theory of well-quasi-ordering: A frequently discovered conceptJournal of Combinatorial Theory, Series A, 1972
- Systems of predicative analysis, II: Representations of ordinalsThe Journal of Symbolic Logic, 1968
- On well-quasi-ordering finite treesMathematical Proceedings of the Cambridge Philosophical Society, 1963
- Continuous increasing functions of finite and transfinite ordinalsTransactions of the American Mathematical Society, 1908