Cut-elimination for Weak Grzegorczyk Logic Go

dc.contributor.author	Gore, Rajeev
dc.contributor.author	Ramanayake, Revantha
dc.date.accessioned	2015-12-13T22:52:11Z
dc.date.issued	2014
dc.date.updated	2015-12-11T10:49:47Z
dc.description.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
dc.identifier.issn	0039-3215
dc.identifier.uri	http://hdl.handle.net/1885/81454
dc.publisher	Kluwer Academic Publishers
dc.source	Studia Logica
dc.title	Cut-elimination for Weak Grzegorczyk Logic Go
dc.type	Journal article
local.bibliographicCitation.issue	1
local.bibliographicCitation.lastpage	27
local.bibliographicCitation.startpage	1
local.contributor.affiliation	Gore, Rajeev, College of Engineering and Computer Science, ANU
local.contributor.affiliation	Ramanayake, Revantha, Ecole Polytechnique
local.contributor.authoruid	Gore, Rajeev, u9409448
local.description.embargo	2037-12-31
local.description.notes	Imported from ARIES
local.identifier.absfor	080203 - Computational Logic and Formal Languages
local.identifier.absseo	970108 - Expanding Knowledge in the Information and Computing Sciences
local.identifier.ariespublication	f5625xPUB9746
local.identifier.citationvolume	102
local.identifier.doi	10.1007/s11225-012-9432-9
local.identifier.scopusID	2-s2.0-84894035484
local.identifier.thomsonID	000331643600001
local.type.status	Published Version

Downloads

Now showing 1 - 1 of 1