Hostname: page-component-7479d7b7d-rvbq7 Total loading time: 0 Render date: 2024-07-09T11:25:57.879Z Has data issue: false hasContentIssue false

On an implication function in many-valued systems of logic

Published online by Cambridge University Press:  12 March 2014

Z. P. Dienes*
Affiliation:
The University of Manchester

Extract

In a paper J. Łukasiewicz and A. Tarski study the systems arising out of the implication function C (x, y) = min(1, 1 – x + y) and the negation function Nx = 1 – x, where x, y are real numbers between 0 and 1 inclusive. Let us then write Сxy = min(1, 1 – x + y) and Nx = 1 – x. (1)

In this note we shall consider another implication function, namely С′xy = ССNxyy, (2)

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1949

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

References

1 Comptes rendus des séances de la Société des Sciences et des Lettres de Varsovie, Classe III, vol. 23 (1930) pp. 30–50.