P
Initializing...
Theorem 1.1 (Tree equivalence): tree equivalence of HORS is undecidable and $\Pi^0_1$-complete, also for safe productive order-four schemes over $\Sigma_2$ · Prove2Me