Scroll nets
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909706414456832 |
|---|---|
| author | Donato, Pablo |
| author_facet | Donato, Pablo |
| contents | We introduce a new formalism for representing proofs in propositional logic called "scroll nets". Its fundamental construct is the "scroll", a topological notation for implication proposed by C. S. Peirce at the end of the 19th century as the basis for his diagrammatic system of existential graphs (EGs). Scroll nets are derived from EGs by following the Curry-Howard methodology of internalizing inference rules inside judgments, just as terms in type theory internalize natural deduction rules. We focus on the intuitionistic implicative fragment of EGs, starting from a natural diagrammatic representation of scroll nets, and then distilling their combinatorial essence into a purely graph-theoretic definition. We also identify a notion of detour, that we use to sketch a detour-elimination procedure akin to cut-elimination. We illustrate how to simulate normalization in the simply typed $λ$-calculus, demonstrating both the logical and computational expressivity of our framework. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_19689 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Scroll nets Donato, Pablo Logic in Computer Science F.4.1 We introduce a new formalism for representing proofs in propositional logic called "scroll nets". Its fundamental construct is the "scroll", a topological notation for implication proposed by C. S. Peirce at the end of the 19th century as the basis for his diagrammatic system of existential graphs (EGs). Scroll nets are derived from EGs by following the Curry-Howard methodology of internalizing inference rules inside judgments, just as terms in type theory internalize natural deduction rules. We focus on the intuitionistic implicative fragment of EGs, starting from a natural diagrammatic representation of scroll nets, and then distilling their combinatorial essence into a purely graph-theoretic definition. We also identify a notion of detour, that we use to sketch a detour-elimination procedure akin to cut-elimination. We illustrate how to simulate normalization in the simply typed $λ$-calculus, demonstrating both the logical and computational expressivity of our framework. |
| title | Scroll nets |
| topic | Logic in Computer Science F.4.1 |
| url | https://arxiv.org/abs/2507.19689 |