Theoremhood-preserving maps characterising cut elimination for modal provability logics
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
|Collections||ANU Research Publications|
|Source:||Journal of Logic and Computation|
|01_Demri_Theoremhood-preserving_maps_2002.pdf||231.15 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.