Tree-Automatic Well-Founded Trees

DOI10.2168/LMCS-9(2:10)2013zbMath1297.03024arXiv1201.5495MaRDI QIDQ5891070

Alexander Kartzow, Markus Lohrey, Jiamou Liu, Martin Huschenbett

Publication date: 9 July 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.5495

zbMATH Keywords

ordinal rankisomorphism problemhyperarithmetical hierarchywell-founded treestree-automatic structures

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Related Items (1)

The isomorphism problem on classes of automatic structures with transitive relations

This page was built for publication: Tree-Automatic Well-Founded Trees