Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T20:35:16.962Z Has data issue: false hasContentIssue false

Deducibility and many-valuedness

Published online by Cambridge University Press:  12 March 2014

D. J. Shoesmith
Affiliation:
Cambridge University, Cambridge, England
T. J. Smiley
Affiliation:
Cambridge University, Cambridge, England

Extract

Lindenbaum's construction of a matrix for a propositional calculus, in which the wffs themselves are taken as elements and the theorems as the designated elements, immediately establishes two general results: that every prepositional calculus is many-valued, and that every many-valued propositional calculus is also ℵ0-valued. These results are however concerned exclusively with theoremhood, the inferential structure of the calculus being relevant only incidentally, in that it may serve to determine the set of theorems. We therefore ask what happens when deducibility is taken into consideration on a par with theoremhood. The answer is that in general the Lindenbaum construction is no longer adequate and both results fail.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1972

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