Cut elimination for the weak modal Grzegorczyk logic via non-well-founded proofs

DOI10.1007/978-3-662-59533-6_34OpenAlexW2963698381MaRDI QIDQ2303617

Daniyar Shamkanov, Yury Savateev

Publication date: 4 March 2020

Full work available at URL: https://arxiv.org/abs/1804.01432

zbMATH Keywords

cut-eliminationcyclic proofsnon-well-founded proofsweak Grzegorczyk logiclogic go

Mathematics Subject Classification ID

Logic in computer science (03B70)

Related Items (1)

Cut-elimination for provability logic by terminating proof-search: formalised and deconstructed using Coq

This page was built for publication: Cut elimination for the weak modal Grzegorczyk logic via non-well-founded proofs