Studia Logica

, Volume 102, Issue 1, pp 1–27

Cut-elimination for Weak Grzegorczyk Logic Go

Article

DOI: 10.1007/s11225-012-9432-9

Cite this article as:
Goré, R. & Ramanayake, R. Stud Logica (2014) 102: 1. doi:10.1007/s11225-012-9432-9
  • 147 Downloads

Abstract

We present a syntactic proof of cut-elimination for weak Grzegorczyk logic Go. The logic has a syntactically similar axiomatisation to Gödel–Löb logic GL (provability logic) and Grzegorczyk’s logic Grz. Semantically, GL can be viewed as the irreflexive counterpart of Go, and Grz can be viewed as the reflexive counterpart of Go. Although proofs of syntactic cut-elimination for GL and Grz have appeared in the literature, this is the first proof of syntactic cut-elimination for Go. The proof is technically interesting, requiring a deeper analysis of the derivation structures than the proofs for GL and Grz. New transformations generalising the transformations for GL and Grz are developed here.

Keywords

Proof theory Syntactic cut-elimination Go Weak Grzegorczyk logic 

Copyright information

© Springer Science+Business Media B.V. 2012

Authors and Affiliations

  1. 1.Logic and Computation Group, Research School of Computer ScienceThe Australian National UniversityCanberraAustralia
  2. 2.CNRS LIX, École PolytechniquePalaiseauFrance

Personalised recommendations