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

by   Nils Kürbis, et al.

Bilateralists hold that the meanings of the connectives are determined by rules of inference for their use in deductive reasoning with asserted and denied formulas. This paper presents two bilateral connectives comparable to Prior's tonk, for which, unlike for tonk, there are reduction steps for the removal of maximal formulas arising from introducing and eliminating formulas with those connectives as main operators. Adding either of them to bilateral classical logic results in an incoherent system. One way around this problem is to count formulas as maximal that are the conclusion of reductio and major premise of an elimination rule and to require their removability from deductions. The main part of the paper consists in a proof of a normalisation theorem for bilateral logic. The closing sections address philosophical concerns whether the proof provides a satisfactory solution to the problem at hand and confronts bilateralists with the dilemma that a bilateral notion of stability sits uneasily with the core bilateral thesis. The Note corrects an error in one of the reduction steps in the paper.


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

A Framework for Reasoning About LF Specifications

This thesis develops a framework for formalizing reasoning about specifi...

Stable Models for Infinitary Formulas with Extensional Atoms

The definition of stable models for propositional formulas with infinite...

Towards a Logic for Reasoning About LF Specifications

We describe the development of a logic for reasoning about specification...

Bilateral Inversion Principles

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

Please sign up or login with your details

Forgot password? Click here to reset