Normalisation and subformula property for a system of classical logic with Tarski’s rule

Archive for Mathematical Logic 61 (1):105-129 (2021)
  Copy   BIBTEX


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.

Author's Profile

Nils Kürbis
Ruhr-Universität Bochum


Added to PP

396 (#43,291)

6 months
115 (#34,421)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?