Spiral
metadata only
Iterated lower bound formulas: a diagonalization-based approach to proof complexity
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
- Strong Normalization via Natural Ordinal#116440
- Statistical Evidence, Normalcy, and the Gatecrasher Paradox#702001
- On a problem of Nathanson related to strongly minimal asymptotic bases of order $h$#1143466
- Bourgain's Lambda(p) selection theorem: a greedy proof with polynomial failure bounds#1070057
- A Class of Sparse Johnson–Lindenstrauss Transforms and Analysis of their Extreme Singular Values#983457
Record · ID 277979
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