MathDB2 problems
- 0 votes0 replies0 views
Ordinal-height invariance of predicative recursion on well-founded partial orders
Ordinal-height conjecture. The predicatively recursive functions on a well-founded partial order correspond to the predicatively recursive functions on its associated ordinal.
- 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