arXiv (All)
open access
Does the Endomorphism Ordered Set of a Finite Ordered Set Determine the Ordered Set? The Cases of Height $1$ and "Trebled" Ordered Sets
For ordered sets $X$ and $Y$, let $Y^X$ denote the ordered set of order-preserving maps from $X$ to $Y$, where $f\le g$ in $Y^X$ if $f(x)\le g(x)$ for all $x\in X$. Let $P$ and $Q$ be finite ordered sets such that $P^P\cong Q^Q$. It is proven that $P\cong Q$ if $P$ or $Q$ has height at most $1$ or
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
- Subordination: Articles and Complementizers#771949
- Generalized Quantifiers: Scope Dominance and Branching#1105801
- Tournament decision theory#761172
- Speaks’s Reduction of Propositions to Properties: A Benacerraf Problem#720554
- Quantitative Merino--Welsh inequalities for joins#1118753
Record · ID 1143133
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