# Normalisation and subformula property for a system of intuitionistic logic with general introduction and elimination rules

Source: [Normalisation and subformula property for a system of intuitionistic logic with general introduction and elimination rules](<https://www.sota2.com/research/paper/68fa588e1e209131ce9af4f9>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T15:24:38.666Z

Authors: Nils K\\"urbis

Published: 2021-10-19T12:37:51.000Z

## Abstract

This paper studies a formalisation of intuitionistic logic by Negri and von Plato which has general introduction and elimination rules. The philosophical importance of the system is expounded. Definitions of \`maximal formula', \`segment' and \`maximal segment' suitable to the system are formulated and corresponding reduction procedures for maximal formulas and permutative reduction procedures for maximal segments given. Alternatives to the main method used are also considered. It is shown that deductions in the system convert into normal form and that deductions in normal form have the subformula property.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2110.09921>)

[PDF](<https://arxiv.org/pdf/2110.09921.pdf>)
