arXiv (All)
open access
Polygraphic resolutions for operated algebras
This paper introduces the structure of operated polygraphs as a categorical model for rewriting in operated algebras, generalizing Gröbner--Shirshov bases with non-monomial termination orders. We show how to construct polygraphic resolutions of free operated algebras from confluent and terminating p
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
- A TEMPORAL RELATIONAL ALGEBRA AS A BASIS FOR TEMPORAL RELATIONAL COMPLETENESS#933514
- Kasei-Theory: Uniqueness of Structural Dependency#95920
- Kasei-Theory I.End: End Without Termination#694273
- Zermelian Extensibility#114550
- Distilling Sequential Computation in Transformer Language Models#1063444
Record · ID 1357005
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