Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T19:44:19.478Z Has data issue: false hasContentIssue false

HARMONISING HARMONY

Published online by Cambridge University Press:  15 May 2015

Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The term ‘harmony’ refers to a condition that the rules governing a logical constant ought to satisfy in order to endow it with a proper meaning. Different characterizations of harmony have been proposed in the literature, some based on the inversion principle, others on normalization, others on conservativity. In this paper we discuss the prospects for showing how conservativity and normalization can be combined so to yield a criterion of harmony equivalent to the one based on the inversion principle: We conjecture that the rules for connectives obeying the inversion principle are conservative over normal deducibility. The plausibility of the conjecture depends in an essential way on how normality is characterized. In particular, a normal deduction should be understood as one which is irreducible, rather than as one which does not contain any maximal formula.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2015