Forster, Thomas (2003) Better-quasi-orderings and coinduction. Theoretical Computer Science, 309 (1). pp. 111-123.
Full text not available from this repository.| Item Type: | Article |
|---|---|
| Faculty \ School: | Faculty of Arts and Humanities > School of Philosophy (former - to 2014) |
| Depositing User: | EPrints Services |
| Date Deposited: | 01 Oct 2010 13:57 |
| Last Modified: | 13 Oct 2025 22:31 |
| URI: | https://ueaeprints.uea.ac.uk/id/eprint/9666 |
| DOI: | 10.1016/S0304-3975(03)00131-2 |
Actions (login required)
![]() |
View Item |
Tools
Tools