↓ Skip to main content

Well-Quasi Orders in Computation, Logic, Language and Reasoning

Overview of attention for book
Attention for Chapter 11: A Combinatorial Bound for a Restricted Form of the Termination Theorem
Altmetric Badge
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
A Combinatorial Bound for a Restricted Form of the Termination Theorem
Chapter number 11
Book title
Well-Quasi Orders in Computation, Logic, Language and Reasoning
Published in
Trends in Logic, January 2020
DOI 10.1007/978-3-030-30229-0_11
Book ISBNs
978-3-03-030228-3, 978-3-03-030229-0
Authors

Silvia Steila, Steila, Silvia

Timeline

Login to access the full chart related to this output.

If you don’t have an account, click here to discover Explorer