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.

Theoremhood-preserving maps characterising cut elimination for modal provability logics

Date

Authors

Demri, Stephane

Gore, Rajeev

Publisher

Oxford University Press

Abstract

Propositional modal provability logics like G and Grz have arithmetical interpretations where □φ can be read as 'formula φ is provable in Peano Arithmetic'. These logics are decidable but are characterized by classes of Kripke frames which are not fir

Keywords

Keywords: Abstracting; Computational complexity; Modal analysis; Syntactics; Cut elimination; Provability modal logic; Formal logic Cut elimination; Display logic; Many-one reduction; Provability modal logic

URI

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

Collections

ANU Research Publications

Source

Journal of Logic and Computation

Type

Journal article

DOI

10.1093/logcom/12.5.861

Restricted until

2037-12-31

Downloads

File

Description

01_Demri_Theoremhood-preserving_maps_2002.pdf (231.15 KB)

abcd