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

Yury Savateev; Daniyar Shamkanov

doi:10.1007/978-3-662-59533-6_34

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

Yury Savateev
, Daniyar Shamkanov

Research output: Contribution to conference › Paper › peer-review

1 Citation (Scopus)

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	https://doi.org/10.1007/978-3-662-59533-6_34
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	https://wollic2019.sites.uu.nl/

Access to Document

10.1007/978-3-662-59533-6_34

Cite this

@conference{eaf7a0a6ef4f4f18a06c88579f22f1e4,

title = "Cut Elimination for the Weak Modal Grzegorczyk Logic via Non-well-Founded Proofs",

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.",

author = "Yury Savateev and Daniyar Shamkanov",

year = "2019",

doi = "10.1007/978-3-662-59533-6\_34",

language = "English",

pages = "569--583",

note = "26th Workshop on Logic, Language, Information and Computation, WoLLIC 2019 ; Conference date: 02-07-2019 Through 05-07-2019",

url = "https://wollic2019.sites.uu.nl/",

}

TY - CONF

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

AU - Savateev, Yury

AU - Shamkanov, Daniyar

N1 - Conference code: 26

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-662-59533-6_34

DO - 10.1007/978-3-662-59533-6_34

M3 - Paper

SP - 569

EP - 583

T2 - 26th Workshop on Logic, Language, Information and Computation

Y2 - 2 July 2019 through 5 July 2019

ER -

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

Abstract

Conference

Access to Document

Fingerprint

Cite this