Term Orders for Optimistic Lambda-Superposition
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911223777329152 |
|---|---|
| author | Bentkamp, Alexander Blanchette, Jasmin Hetzenberger, Matthias |
| author_facet | Bentkamp, Alexander Blanchette, Jasmin Hetzenberger, Matthias |
| contents | We introduce $λ$KBO and $λ$LPO, two variants of the Knuth-Bendix order (KBO) and the lexicographic path order (LPO) designed for use with the $λ$-superposition calculus. We establish the desired properties via encodings into the familiar first-order KBO and LPO. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_18452 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Term Orders for Optimistic Lambda-Superposition Bentkamp, Alexander Blanchette, Jasmin Hetzenberger, Matthias Logic in Computer Science I.2.3; F.4.1 We introduce $λ$KBO and $λ$LPO, two variants of the Knuth-Bendix order (KBO) and the lexicographic path order (LPO) designed for use with the $λ$-superposition calculus. We establish the desired properties via encodings into the familiar first-order KBO and LPO. |
| title | Term Orders for Optimistic Lambda-Superposition |
| topic | Logic in Computer Science I.2.3; F.4.1 |
| url | https://arxiv.org/abs/2510.18452 |