论文信息 - Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes - 字舞流文

Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes

We characterize Post classes of Boolean functions (also known as clones) in terms of forbidden subfunctions that allows one to give a comparably short proof of the classical Post theorem.

Igor E. Zverovich | I. Zverovich

[1] S. V. Yablonsky,et al. Introduction to discrete mathematics , 1989 .

[2] Amar Mukhopadhyay. Recent developments in switching theory , 1971 .

[3] Norman M. Martin,et al. Post's Functional Completeness Theorem , 1990, Notre Dame J. Formal Log..

[4] Claude Benzaken. Post's closed systems and the weak chromatic number of hypergraphs , 1978, Discret. Math..

[5] B. A. Gregory,et al. Problems and Exercises , 1981 .

[6] Emil L. Post. The two-valued iterative systems of mathematical logic , 1942 .

[7] S. S. Marchenkov. Existence of finite bases in closed classes of Boolean functions , 1984 .

[8] David C. Rine,et al. Computer science and multiple-valued logic : theory and applications , 1977 .

[9] Jean Kuntzmann. Algèbre de Boole , 1965 .

[10] Emil L. Post. Introduction to a General Theory of Elementary Propositions , 1921 .

[11] Nicholas Pippenger,et al. Theories of computability , 1997 .

[12] Inductive representations of Boolean functions and the finite generation of the post classes , 1984 .

[13] Stephan Foldes,et al. Post classes characterized by functional terms , 2004, Discret. Appl. Math..

[14] Amar Mukhopadhyay. COMPLETE SETS OF LOGIC PRIMITIVES , 1971 .

[15] Claude Benzaken. From Logical Gates Synthesis to Chromatic Bicritical Clutters , 1999, Discret. Appl. Math..