Open Research

Formalised cut admissibility for display logic

dc.contributor.author	Dawson, Jeremy
dc.contributor.author	Gore, Rajeev
dc.coverage.spatial	Hampton USA
dc.date.accessioned	2015-12-13T23:24:40Z
dc.date.available	2015-12-13T23:24:40Z
dc.date.created	August 20 2002
dc.identifier.isbn	0302-9743
dc.identifier.uri	http://hdl.handle.net/1885/92328
dc.publisher	Springer
dc.relation.ispartofseries	International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2002)
dc.source	Theorem Proving in Higher Order Logics
dc.title	Formalised cut admissibility for display logic
dc.type	Conference paper
local.description.notes	Imported from ARIES
local.description.refereed	Yes
dc.date.issued	2002
local.identifier.absfor	080299 - Computation Theory and Mathematics not elsewhere classified
local.identifier.ariespublication	MigratedxPub23389
local.type.status	Published Version
local.contributor.affiliation	Dawson, Jeremy, College of Engineering and Computer Science, ANU
local.contributor.affiliation	Gore, Rajeev, College of Engineering and Computer Science, ANU
local.bibliographicCitation.startpage	131
local.bibliographicCitation.lastpage	147
dc.date.updated	2015-12-12T09:21:25Z
Collections	ANU Research Publications

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.