Normalisation and Subformula Property for a System of Classical Logic with Tarski's Rule

by   Nils Kürbis, et al.

This paper considers a formalisation of classical logic using general introduction rules and general elimination rules. It proposes a definition of `maximal formula', `segment' and `maximal segment' suitable to the system, and gives reduction procedures for them. It is then shown that deductions in the system convert into normal form, i.e. deductions that contain neither maximal formulas nor maximal segments, and that deductions in normal form satisfy the subformula property. Tarski's Rule is treated as a general introduction rule for implication. The general introduction rule for negation has a similar form. Maximal formulas with implication or negation as main operator require reduction procedures of a more intricate kind not present in normalisation for intuitionist logic.


page 1

page 2

page 3

page 4


Normalisation for Bilateral Classical Logic with some Philosophical Remarks, and a Note on it

Bilateralists hold that the meanings of the connectives are determined b...

Bilateral Inversion Principles

This paper formulates a bilateral account of harmony that is an alternat...

A Simple Rewrite System for the Normalization of Linear Temporal Logic

In the mid 80s, Lichtenstein, Pnueli, and Zuck showed that every formula...

What Does This Notation Mean Anyway?

Following the introduction of BNF notation by Backus for the Algol 60 re...

Puzzles of Existential Generalisation from Type-theoretic Perspective

The present paper addresses several puzzles related to the Rule of Exist...

Please sign up or login with your details

Forgot password? Click here to reset