arXiv (All)
open access
Quotient codings and the descriptive complexity of algebraic and analytic structures
We study the descriptive complexity of algebraic and analytic properties by presenting structures as quotients of fixed generators. For separable Banach-type structures, admissible kernels form Polish spaces and quotient norms are continuous in the Wijsman topology. For countable algebraic structure
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
- The Order of the Non-universal Tree of a Hilbert Space with Respect to the Haar Basis#822305
- Connes-embeddability and twisted group von Neumann algebras#1154508
- A quotient of the Bruhat-Tits building classifying maximal matrix orders over curves#1326043
- The SATOR Matrix - The Transcendent Bridge. Existence as Fundamental Information: Stable, Distinguishable, Minimal#618172
- Factor Code Networks#1155404
Record · ID 1248408
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