Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.01375 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913339534213120 |
|---|---|
| author | Bruni, Alessandro Ritter, Eike Schürmann, Carsten |
| author_facet | Bruni, Alessandro Ritter, Eike Schürmann, Carsten |
| contents | Focusing is a known technique for reducing the number of proofs while preserving derivability. Skolemisation is another technique designed to improve proof search, which reduces the number of back-tracking steps by representing dependencies on the term level and instantiate witness terms during unification at the axioms or fail with an occurs-check otherwise. Skolemisation for classical logic is well understood, but a practical skolemisation procedure for focused intuitionistic linear logic has been elusive so far. In this paper we present a focused variant of first-order intuitionistic linear logic together with a sound and complete skolemisation procedure. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_01375 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Skolemisation for Intuitionistic Linear Logic Bruni, Alessandro Ritter, Eike Schürmann, Carsten Logic in Computer Science Focusing is a known technique for reducing the number of proofs while preserving derivability. Skolemisation is another technique designed to improve proof search, which reduces the number of back-tracking steps by representing dependencies on the term level and instantiate witness terms during unification at the axioms or fail with an occurs-check otherwise. Skolemisation for classical logic is well understood, but a practical skolemisation procedure for focused intuitionistic linear logic has been elusive so far. In this paper we present a focused variant of first-order intuitionistic linear logic together with a sound and complete skolemisation procedure. |
| title | Skolemisation for Intuitionistic Linear Logic |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2405.01375 |