arXiv (OAI Expanded)
open access
Restrictions of Infinite Circuits
We present a new approach to lower bounds on Borel rank via a connection between Borel sets and infinite circuits. We prove an infinite analog to Håstad's switching lemma called the \emph{restriction lemma}, which shows that by fixing the values of some inputs, we can simultaneously reduce the compl
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
- Exponential, Finite-Time and Fixed-Time Small-Gain Theorems for Interconnected Systems#142586
- Rokhlin property and approximate representability for inclusions of index-finite type#635507
- Rokhlin property and approximate representability for inclusions of index-finite type#633158
- Sharp and Growing Linear-Excess Inverse Theorems for Sets with Few Subset Sums#1097482
- More on dominated and microscopic sets#1145109
Record · ID 1083517
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