Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Mechanising cut-elimination for display logic

Thumbnail Image

Date

2001

Authors

Dawson, Jeremy
Gore, Rajeev

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

We describe a deep embedding of the display calculus ÆRA, for relation algebras, using Isabelle/HOL. We then describe how the embedding was used to formalise a cut-elimination theorem for ÆRA. Our implementation generalises easily to handle other display calculi. We consider a published proof of strong normalization of cut-elimination for Display Logic, and discuss the problems with it which prevented us from being able to implement it. We then give a different proof and describe its implementation in Isabelle/HOL.

Description

Keywords

proof systems for relation algebra, non-classical logics, automated deduction, display logic, cut elimination, machine-checked proof theory, strong normalization, TR-CS

Citation

URI

http://hdl.handle.net/1885/40728
 http://digitalcollections.anu.edu.au/handle/1885/40728

Collections

ANU Research Publications

Source

Type

Working/Technical Paper

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

Downloads

File
Description
TR-CS-01-02.pdf (334.16 KB)

DSpace software copyright © 2002-2026 LYRASIS