Tree-automatic well-founded trees
aut.relation.articlenumber | 10 | |
aut.relation.endpage | 44 | |
aut.relation.issue | 2 | |
aut.relation.pages | 44 | |
aut.relation.startpage | 1 | |
aut.relation.volume | 9 | |
aut.researcher | Liu, Jiamou | |
dc.contributor.author | Liu, J | |
dc.contributor.author | Kartzow, A | |
dc.contributor.author | Lohrey, M | |
dc.contributor.author | Huschenbett, M | |
dc.contributor.editor | Scott, D | |
dc.contributor.editor | Adámek, J | |
dc.contributor.editor | Milius, S | |
dc.date.accessioned | 2014-02-12T20:46:03Z | |
dc.date.available | 2014-02-12T20:46:03Z | |
dc.date.copyright | 2013-06-25 | |
dc.date.issued | 2013-06-25 | |
dc.description.abstract | We investigate tree-automatic well-founded trees. Using Delhomme's decomposition technique for tree-automatic structures, we show that the (ordinal) rank of a tree-automatic well-founded tree is strictly below omega^omega. Moreover, we make a step towards proving that the ranks of tree-automatic well-founded partial orders are bounded by omega^omega^omega: we prove this bound for what we call upwards linear partial orders. As an application of our result, we show that the isomorphism problem for tree-automatic well-founded trees is complete for level Delta^0_{omega^omega} of the hyperarithmetical hierarchy with respect to Turing-reductions. | |
dc.identifier.citation | Logical Methods in Computer Science, vol.9(2), pp.1 - 44 (44) | |
dc.identifier.doi | 10.2168/LMCS-9(2:10)2013 | |
dc.identifier.uri | https://hdl.handle.net/10292/6736 | |
dc.language | English | |
dc.publisher | International Federation of Computational Logic | |
dc.relation.uri | http://dx.doi.org/10.2168/LMCS-9(2:10)2013 | |
dc.rights | Logical Methods in Computer Science is a fully refereed, open access, free, electronic journal.Copyright is retained by the author. Full-text access to all papers is freely available. | |
dc.rights.accessrights | OpenAccess | |
dc.title | Tree-automatic well-founded trees | |
dc.type | Journal Article | |
pubs.elements-id | 160914 | |
pubs.organisational-data | /AUT | |
pubs.organisational-data | /AUT/Design & Creative Technologies | |
pubs.organisational-data | /AUT/Design & Creative Technologies/School of Computing & Mathematical Science |