Pages that link to "Item:Q3305561"
From MaRDI portal
The following pages link to Higman’s Lemma and Its Computational Content (Q3305561):
Displaying 4 items.
- The computational significance of Hausdorff's maximal chain principle (Q2106609) (← links)
- A Mechanized Proof of Higman’s Lemma by Open Induction (Q3295156) (← links)
- Deciding atomicity of subword-closed languages (Q6549668) (← links)
- Representations of \(\mathbb{N}^{\infty}\)-type combinatorial categories (Q6668534) (← links)