On η-valued functionally complete truth functions
暂无分享,去创建一个
[1] Eric Foxley,et al. The determination of all Sheffer functions in 3-valued logic, using a logical computer , 1962, Notre Dame J. Formal Log..
[2] John Riordan,et al. Introduction to Combinatorial Analysis , 1958 .
[3] Norman M. Martin. The Sheffer functions of 3-valued logic , 1954, Journal of Symbolic Logic.
[4] R. F. Wheeler. Complete Propositional Connectives , 1961 .
[5] Alan Rose,et al. Review: Norman M. Martin, Some Analogues of the Sheffer Stroke Function in n-Valued Logic , 1951 .
[6] Donald L. Webb,et al. Definition of Post's Generalized Negative and Maximum in Terms of One Binary Operation , 1936 .
[7] Barkley Rosser. On the Many-Valued Logics , 1941 .
[8] Emil L. Post. Introduction to a General Theory of Elementary Propositions , 1921 .
[9] Roger F. Wheeler,et al. Complete Connectives for the 3‐Valued Propositional Calculus , 1966 .
[10] R. F. Wheeler. An Asymptotic Formula for the Number of Complete Propositional Connectives , 1962 .
[11] John Riordan,et al. Introduction to Combinatorial Analysis , 1959 .