1 problem

0 votes0 replies0 views
The rank bound conjecture for tree-automatic well-founded partial orders
Rank bound conjecture. Every tree-automatic well-founded partial order has rank below
Conjectureopenordinal-ranks tree-automatic-structures well-founded-ordersarXiv posted 2 days ago

The rank bound conjecture for tree-automatic well-founded partial orders