Hostname: page-component-6bb9c88b65-2jdt9 Total loading time: 0 Render date: 2025-07-27T07:50:39.678Z Has data issue: false hasContentIssue false
  • English
  • Français

Truth Tables*

Published online by Cambridge University Press:  03 November 2016

R. L. Goodstein
R. L. Goodstein*
Affiliation:
University of Leiester
Get access Rights & Permissions [Opens in a new window]

Extract

The problem I am going to discuss is the generation of the class of all mappings of the space S×S×.. × S, with any number of factors, into S itself, from a single mapping of the class, where S is a finite set. The problem has its origin in the study of truth tables and it is in this setting that the problem may be most simply presented.

Information

Type
Research Article
Information
The Mathematical Gazette , Volume 46 , Issue 355 , February 1962 , pp. 18 - 23
Copyright
Copyright © Mathematical Association 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

page 18 note *

A Lecture given at the meeting of the British Association in Norwich, September, 1961.

References

1. Cuninghame-Green, R. A., Single Primitive Ternary Connectives for the 2-valued Propositional Calculus. Zeitschr, f. math. Logik una Grundlagen d. Math. Vol. 5. Part 2. 1959. 206–207 Google Scholar
2. Cuninghame-Green, R. A., Ph.D. thesis, University of Leicester, 1961.Google Scholar
3. Goodstein, R. L., Polynomial Generators over Galois Fields. Journal London Math. Soc. 36 (1961), 29–32.Google Scholar
4. Martin, N. M., The Sheffer functions of 3-valued logic. Journal of Symbolic Logic. 19 (1954), 45–51.Google Scholar
5. Post, E., The two-valued Iterative System of Mathematical Logic. Princeton, 1941.Google Scholar
6. Webb, D. L., Generation of any n-valued logic by one binary operator. Proc. Nat. Acad. Sci. U.S.A., 21 (1935), 252–254.Google Scholar
7. Wheeler, R. F, Complete Propositional Connectives. Zeitschr. f math. Logik und Grundlagen d. Math. Vol. 7 Part 4. 1961. pp. 185–198.Google Scholar