Hostname: page-component-7dd5485656-hw7sx Total loading time: 0 Render date: 2025-10-31T04:22:12.259Z Has data issue: false hasContentIssue false
  • English
  • Français

Functional completeness and canonical forms in many-valued logics1

Published online by Cambridge University Press:  12 March 2014

William H. Jobe
William H. Jobe*
Affiliation:
University of Tulsa and University of Kansas
Get access Rights & Permissions [Opens in a new window]

Extract

This paper examines the questions of functional completeness and canonical completeness in many-valued logics, offering proofs for several theorems on these topics.

A skeletal description of the domain for these theorems is as follows. We are concerned with a proper logic L, containing a denumerably infinite class of propositional symbols, P, Q, R, …, a finite set of unary operations, U1, U2,…, Ub, and a finite set of binary operations, B1, B2, …, Bc. Well-formed formulas in L are recursively defined by the conventional set of rules. With L there is associated an integer, M ≧ 2, and the integers m, where (1 ≦m≦M), are the truth values of L.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 27 , Issue 4 , December 1962 , pp. 409 - 422
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

Footnotes

1

The author gratefully acknowledges the aid of Walter E. Stuermann, Professor of Philosophy at the University of Tulsa, in bringing this paper into its published form.

References

[1] Birkhoff, G. and Maclane, S., A survey of modern algebra, New York (Macmillan), 1957.Google Scholar
[2] Łukasiewicz, Jan, Philosophische Bemerkungen zu mehrwertigen Systemen des Aussagenkalküls, Comtes rendus des séances de la Société des Sciences et des Lettres de Varsovie, classe III, Vol. 23 (1930), pp. 57–77.Google Scholar
[3] Martin, N., A note on Sheffer functions in N-valued logic, Methodos, Vol. 3 (1951), p. 241.Google Scholar
[4] Rosser, J. B. and Turquette, A. R., Many-valued logics, Amsterdam (North-Holland), 1955.Google Scholar
[5] Słupecki, Jerzy, Der volle dreiwertige Aussagen-kalkül, Comtes rendus des séances de la Société des Sciences et des Lettres de Varsovie, classe III, Vol. 29 (1936), pp. 9–11.Google Scholar
[6] Słupecki, Jerzy, Kryterium pelnosci wielowartosciowych systemow logiki zdan (A criterion of fullness of many-valued systems of propositional logic), Comtes rendus des séances de la Société des Sciences et des Lettres de Varsovie, classe III, Vol. 32 (1939), pp. 102–109.Google Scholar