Abstract
We present a sequent calculus for the weak Grzegorczyk logic Go allowing non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs.
Original language | English |
---|---|
Pages | 569-583 |
DOIs | |
Publication status | Published - 2019 |
Event | 26th Workshop on Logic, Language, Information and Computation - Utrecht, Netherlands Duration: 2 Jul 2019 → 5 Jul 2019 Conference number: 26 https://wollic2019.sites.uu.nl/ |
Conference
Conference | 26th Workshop on Logic, Language, Information and Computation |
---|---|
Abbreviated title | WoLLIC 2019 |
Country/Territory | Netherlands |
City | Utrecht |
Period | 2/07/19 → 5/07/19 |
Internet address |