A simplified lower bound for implicational logic
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917029570674688 |
|---|---|
| author | Jeřábek, Emil |
| author_facet | Jeřábek, Emil |
| contents | We present a streamlined and simplified exponential lower bound on the length of proofs in intuitionistic implicational logic, adapted to Gordeev and Haeusler's dag-like natural deduction. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2303_15090 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A simplified lower bound for implicational logic Jeřábek, Emil Logic in Computer Science Logic 03F20 (Primary) 03B20 (Secondary) We present a streamlined and simplified exponential lower bound on the length of proofs in intuitionistic implicational logic, adapted to Gordeev and Haeusler's dag-like natural deduction. |
| title | A simplified lower bound for implicational logic |
| topic | Logic in Computer Science Logic 03F20 (Primary) 03B20 (Secondary) |
| url | https://arxiv.org/abs/2303.15090 |