Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-25T19:33:53.431Z Has data issue: false hasContentIssue false

Note on Słupecki T-functions1

Published online by Cambridge University Press:  12 March 2014

Robert E. Clay*
Affiliation:
University of Notre Dame

Extract

For the m-valued (2<w<∞) logics of Łukasiewicz as described in [2] using the values 1,2, …, m and based on the functions f(p, q) = max(1,q—p+1) and g(p) = m—p+1, Evans and Schwartz have essentially2 proved in [1] that the addition of a constant function i, 1<i<m, yields functional completeness if and only if (m—1, i—1)= 1.3 In this note it will be shown that if n constant functions i1, …, in, 1<ik<m and 1≦kn, are added, functional completeness obtains if and only if (m—1, i1—1, …, in—1) = 1.

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

Footnotes

1

The author is indebted to the referee for extensive simplification of both proof and presentation.

References

[1]Evans, T. and Schwartz, P. B., On Słupecki T-functions, this Journal, vol. 23 (1958), pp. 267270.Google Scholar
[2]Łukasiewicz, J. and Tarski, A., Untersuchungen über den Aussagenkalkül, Comptes rendus des séances de la Société des Sciences et des Lettres de Varsovie, Classe III, vol. 23 (1950), pp. 3050.Google Scholar