论文信息 - A Theory of Completely Monotonic Functions and its Applications to Threshold Logic - 字舞流文

A Theory of Completely Monotonic Functions and its Applications to Threshold Logic

Abstract—As an approach to clarifying the basic properties of threshold logic, the completely monotonic function is investigated. Its testing procedure, functional form, etc., are discussed by using a new concept, mutual monotonicity.

T. Ibaraki | S. Yajima | T. Ibaraki | S. Yajima

[1] Saburo Muroga. Functional forms of dual-comparable functions and a necessary and sufficient condition for readability of a majority function , 1964, IEEE Transactions on Communication and Electronics.

[2] Robert O. Winder,et al. Enumeration of Seven-Argument Threshold Functions , 1965, IEEE Trans. Electron. Comput..

[3] Irving J. Gabelman,et al. Properties and Transformations of Single Threshold Element Functions , 1964, IEEE Trans. Electron. Comput..

[4] Calvin C. Elgot,et al. Truth functions realizable by single threshold organs , 1961, SWCT.

[5] Robert O. Winder,et al. Single stage threshold logic , 1961, SWCT.

[6] Eiichi Goto,et al. Some Theorems Useful in Threshold Logic for Enumerating Boolean Functions , 1962, IFIP Congress.

[7] S. Muroga,et al. Theory of majority decision elements , 1961 .

[8] Paolo Ercoli,et al. Threshold Logic with One or more than One Threshold , 1962, IFIP Congress.