On η-valued functionally complete truth functions
- 1 August 1967
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 32 (2), 190-195
- https://doi.org/10.2307/2271656
Abstract
It is well known that the familiar Sheffer stroke function of the 2-valued propositional calculus is functionally complete (i.e., for any m, all 22m truth functions of m variables can be defined1 in terms of the stroke function). Indeed, it is not difficult to show that of the 16 2-valued functions of two variables, exactly two of them are functionally complete.Keywords
This publication has 8 references indexed in Scilit:
- Complete Connectives for the 3-Valued Propositional CalculusProceedings of the London Mathematical Society, 1966
- An Asymptotic Formula for the Number of Complete Propositional ConnectivesMathematical Logic Quarterly, 1962
- The determination of all Sheffer functions in $3$-valued logic, using a logical computer.Notre Dame Journal of Formal Logic, 1962
- Complete Propositional ConnectivesMathematical Logic Quarterly, 1961
- Many-valued Logics. By J.B. Rosser and A.R. Turquette. Pp. 124. F1. 12. 1952. Studies in logic and the foundations of mathematics. (North-Holland Publishing Co., Amsterdam)The Mathematical Gazette, 1953
- Some Analogues of the Sheffer Stroke Function in n-Valued Logic.The Journal of Symbolic Logic, 1951
- Definition of Post's Generalized Negative and Maximum in Terms of One Binary OperationAmerican Journal of Mathematics, 1936
- Introduction to a General Theory of Elementary PropositionsAmerican Journal of Mathematics, 1921