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

by   Nils Kürbis, et al.

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.


page 1

page 2

page 3

page 4


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

This paper considers a formalisation of classical logic using general in...

Bilateral Inversion Principles

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

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...

Covered Clause Elimination

Generalizing the novel clause elimination procedures developed in [M. He...

Extensional proofs in a propositional logic modulo isomorphisms

System I is a proof language for a fragment of propositional logic where...

Confluence and Convergence in Probabilistically Terminating Reduction Systems

Convergence of an abstract reduction system (ARS) is the property that a...

Please sign up or login with your details

Forgot password? Click here to reset