Cut Elimination for the Weak Modal Grzegorczyk Logic via Non-well-Founded Proofs

Yury Savateev, Daniyar Shamkanov

Research output: Contribution to conferencePaperpeer-review

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 languageEnglish
Pages569-583
DOIs
Publication statusPublished - 2019
Event26th Workshop on Logic, Language, Information and Computation - Utrecht, Netherlands
Duration: 2 Jul 20195 Jul 2019
Conference number: 26
https://wollic2019.sites.uu.nl/

Conference

Conference26th Workshop on Logic, Language, Information and Computation
Abbreviated titleWoLLIC 2019
Country/TerritoryNetherlands
CityUtrecht
Period2/07/195/07/19
Internet address

Fingerprint

Dive into the research topics of 'Cut Elimination for the Weak Modal Grzegorczyk Logic via Non-well-Founded Proofs'. Together they form a unique fingerprint.

Cite this