arXiv (All)
open access
A Dichotomy Theorem for Ordinal Ranks in MSO
We focus on formulae $\exists X.\, φ(\vec{Y}, X)$ of monadic second-order logic over the full binary tree, such that the witness $X$ is a well-founded set. The ordinal rank $\mathrm{rank}(X) < ω_1$ of such a set $X$ measures its depth and branching structure. We search for the least upper bound for
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
- Cumulative link models — CLM & CLMM (para análise de variáveis dependentes ordinais)#276850
- HyperGraph and SuperHyperGraph Theory with Applications (VIII): Hierarchical SuperHyperGraph, Recursive SuperHyperGraph, and Related Graph Theory#694355
- Proofs Without Nominals: Gödel's Ontological Argument, its Shallow Embedding, and the Open Questions of the Monatshefte Notes#1131121
- Partially Identified Rankings from Pairwise Interactions#1070661
- The Shape of a Total Theory's Base: Categorial Foreclosures and What They Force#692791
Record · ID 986107
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