arXiv (All)
open access
Width-Bounded Equational Derivations for Finite Graph Expressions
Completeness of an equational presentation guarantees an equality path but need not control the resources used along it. For finite graph expressions we measure derivational space by the largest input-output interface of an intermediate raw term. For every finite doubly ranked edge alphabet $Σ$, we
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
- Automated Termination Proving : contributions to Graph Rewriting via Extended Weighted Type Graphs and Morphism Counting#370840
- Paths and Intersections: Repelling Pairs#997514
- A Quantum Annealing Approach to Graph Partitioning#641684
- SciWalker: Synthesizing Scientific Coding Problems with Operator Graphs and Execution Feedback#1078125
- Advancing Mathematics Research with AI-Driven Formal Proof Search#216859
Record · ID 985689
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