arXiv (All)
open access
Types of well-founded trees and the homomorphism order
We introduce an ordinal-valued invariant of well-founded trees, called their type. We use type to give an alternative proof that the class of all well-founded trees is well-quasi-ordered by the homomorphism relation, and we establish a relationship between type and the usual ordinal rank of a well-f
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth#173285
- Ordered trees with distinguished children#614936
- Ordered trees with distinguished children#613969
- Tree versus tree of preorder induced by rainbow forbidden subgraphs#973026
- The EU Nature Restoration Regulation offers new opportunities for resilient forests and sustainable forestry.#263344
Record · ID 1049938
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive