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.

Generic Methods for formalising sequent Calculi Applied to provability logic

Date

Authors

Dawson, Jeremy

Gore, Rajeev

Publisher

Springer

Abstract

We describe generic methods for reasoning about multiset-based sequent calculi which allow us to combine shallow and deep embeddings as desired. Our methods are modular, permit explicit structural rules, and are widely applicable to many sequent systems,

Keywords

Keywords: Algebraic manipulations; Axiomatic type class; cut admissibility; Embeddings; Generic method; Interactive theorem proving; Isabelle/HOl; Large parts; Machine-checked proofs; Multiset; Natural deduction; Non-trivial; Proof theory; provability logic; Sequen cut admissibility; interactive theorem proving; proof theory; provability logic

URI

http://hdl.handle.net/1885/20780

Collections

ANU Research Publications

Source

Proceedings of International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2010)

Type

Conference paper

DOI

10.1007/978-3-642-16242-8-19

Restricted until

2037-12-31

Downloads

File

Description

01_Dawson_Generic_Methods_for_2010.pdf (458.73 KB)

02_Dawson_Generic_Methods_for_2010.pdf (236.25 KB)