Thomas Forster. Better-quasi-orderings and coinduction. Theoretical Computer Science, 309(1-3):111-123, 2003. [doi]
@article{Forster03,
title = {Better-quasi-orderings and coinduction},
author = {Thomas Forster},
year = {2003},
doi = {10.1016/S0304-3975(03)00131-2},
url = {http://dx.doi.org/10.1016/S0304-3975(03)00131-2},
researchr = {https://researchr.org/publication/Forster03},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {309},
number = {1-3},
pages = {111-123},
}