Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T12:40:54.821Z Has data issue: false hasContentIssue false

The independence of connectives

Published online by Cambridge University Press:  12 March 2014

Timothy Smiley*
Affiliation:
University of Cambridge

Extract

In a paper in this Journal [1], McKinsey used as a criterion for the independence (non-definability) of a connective F in a propositional calculus L, the existence of a matrix for L in which the functions corresponding to all the connectives other than F are class-closing over some subset S of the elements, while the function corresponding to F is not class-closing over S (i.e., for a certain choice of arguments in S its value is not in S).

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1962

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable