Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.14933 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918390252175360 |
|---|---|
| author | Enqvist-Pyk, Sebastian |
| author_facet | Enqvist-Pyk, Sebastian |
| contents | Herbrand schemes are a method to extract Herband disjunctions directly from sequent calculus proofs, without appealing to cut elimination, using a formal grammar known as a higher-order recursion scheme. In this note, we show that the core ideas of Herbrand schemes can be reformulated as a functional interpretation of classical sequent calculus, similar to the functional interpretation of classical logic due to Gerhardy and Kohlenbach. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_14933 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | From Herbrand schemes to functional interpretation Enqvist-Pyk, Sebastian Logic in Computer Science Herbrand schemes are a method to extract Herband disjunctions directly from sequent calculus proofs, without appealing to cut elimination, using a formal grammar known as a higher-order recursion scheme. In this note, we show that the core ideas of Herbrand schemes can be reformulated as a functional interpretation of classical sequent calculus, similar to the functional interpretation of classical logic due to Gerhardy and Kohlenbach. |
| title | From Herbrand schemes to functional interpretation |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2603.14933 |