Galois theory for minors of finite functions

Discrete Mathematics

Volumn 254, Issue 1-3, 2002, Pages 405-419

  Pippenger, Nicholas ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 31244436929     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(01)00297-7     Document Type: Article

References (25)

1. I. Ágoston, J. Demetrovics, L. Hannák, On the number of clones containing all constants, Colloq. Math. Soc. János Bolyai 43 (1983) 21-25.
2. V.G. Bodnarchuk, L.A. Kaluzhnin, V.N. Kotov, B.A. Romov, Galois theory for Post algebras. I, II, Cybernetics 5 (1969) 243-252, 531-539.
3. G.A. Burle, Classes of k-valued logic which contain all functions of a single variable, Discretnyǐ Analiz 10 (1967) 3-7.
4. G.C. Denham, Many-valued generalizations of two finite intervals in Post's lattice, Proceedings of the International Symposium on Multi-Valued Logic, Vol. 24, 1994, pp. 314-318.
5. O. Ekin, S. Foldes, P.L. Hammer, L. Hellerstein, Equational characterizations of Boolean function classes, Discrete Math. 211 (2000) 27-51.
6. C.J. Everett, Closure operations and Galois theory in lattices, Trans. AMS 55 (1944) 514-525.
7. A. Feigelson, L. Hellerstein, The forbidden projections of unate functions, Discrete Appl. Math. 77 (1997) 221-236.
8. D. Geiger, Closed systems of functions and predicates, Pacific J. Math. 27 (1968) 95-100.
9. L. Haddad, I.G. Rosenberg, A note on finite clones containing all permutations, Proceedings of the International Symposium on Multi-Valued Logic, Vol. 20, 1990, pp. 34-41.
10. L. Haddad, I.G. Rosenberg, Finite clones containing all permutations, Can. J. Math. 46 (1994) 951-970.
11. L. Hellerstein, On generalized constraints and certificates, Discrete Math. 226 (2001) 211-232.
12. M. Krasner, Une generalisation de la notion de corps, J. Math. Pures Appl. 17 (1938) 367-385.
13. M. Krasner, Abstract Galois theory and endotheory. I, Acta Sci. Math. 50 (1986) 253-286.
14. M. Krasner, Abstract Galois theory and endotheory. II, Acta Sci. Math. 52 (1988) 231-255.
15. R. McNaughton, Unate truth functions, IRE Trans. Electron. Comput. 10 (1961) 1-6.
16. Ø. Ore, Galois connexions, Trans. AMS 55 (1944) 493-513.
17. R. Pöschel, Postsche Algebren von Funktionen über einer Familie endlicher Mengen, Z. Math. Logik Grundl. Math. 19 (1973) 37-74.
18. R. Pöschel, Die funktionale Vollständigkeit von Funktionenklassen über einer Familie endlicher Mengen, Z. Math. Logik Grundl. Math. 19 (1973) 37-74.
19. R. Pöschel, L.A. Kaluzhnin, Funktionen- und Relationenalgebren, Birkhäuser, Basel, 1979.
20. E. Post, The Two-Valued Iterative Systems of Mathematical Logic, Princeton University Press, Princeton, 1941.
21. P.D. Seymour, The forbidden minors of binary clutters, J. London Math. Soc. 12 (2) (1976) 356-360.
22. C. Wang, Boolean minors, Discrete Math. 141 (1995) 237-258.
23. C. Wang, A.C. Williams, The threshold order of a Boolean function, Discrete Appl. Math. 31 (1991) 51-69.
24. M. Ward, The closure operators of lattice, Ann. Math. 43 (1942) 191-196.
25. R.O. Winder, Fundamentals of threshold logic, in: J.T. Tou (Ed.), Applied Automata Theory, Academic Press, New York, 1968, pp. 235-318.