arXiv (All)
open access
Descriptive Complexity in Lean: Completeness by First-Order Reductions
We show that descriptive complexity can serve as a foundation for formalizing computational complexity results in a proof assistant, by constructing a Lean library centered around the following concepts: decision problems are isomorphism-invariant predicates on finite structures; complexity classes
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
- MechMath: Sorrifier-Driven Formal Decomposition Workflow for Automated Theorem Proving#614966
- MechMath: Sorrifier-Driven Formal Decomposition Workflow for Automated Theorem Proving#613999
- Can one amplify P=NP beyond P=PH?#787563
- State-Separation and Hybrid Argument for Circuit Lower Bounds: A Structural Approach Toward P̸=NP#101306
- Hierarchical Correctness Proofs for Distributed Algorithms#472207
Record · ID 1012457
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