Equational characterizations of Boolean function classes

Discrete Mathematics

Volumn 211, Issue 1-3, 2000, Pages 27-51

  Ekin, Oya ^a   Foldes, Stephan ^b   Hammer, Peter L ^b   Hellerstein, Lisa ^c  

^a BILKENT UNIVERSITY   (Turkey)

^b RUTGERS UNIVERSITY   (United States)

^c POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002328242     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00132-6     Document Type: Article

References (18)

1. J.L. Bell, A.B. Slomson, Models and Ultraproducts: An Introduction, North-Holland, Amsterdam, 1969.
2. O. Ekin, Special classes of boolean functions, Ph.D. Thesis, Rutgers University, 1997.
3. O. Ekin, P.L Hammer, U.N. Peled, Horn functions and submodular Boolean functions, Theoret. Comput. Sci. 175 (1997) 257-270.
4. S. Foldes, Fundamental Structures of Algebra and Discrete Mathematics, Wiley, New York, 1994.
5. S. Foldes, Equational varieties of Boolean functions via the HSP Theorem, Technical Report 18-98, Rutgers Center for Operations Research, July 1998, http://rutcor.rutgers.edu/~rrr.
6. L. Hellerstein, On generalized constraints and certificates, Technical Report 26-98, Rutgers Center for Operations Research, September 1998, http://rutcor.rutgers.edu/~rrr.
7. P.L. Hammer, A. Kogan, Horn functions and their DNFs, Inform. Process. Lett. 44 (1992) 23-29.
8. P.L. Hammer, S. Rudeanu, Boolean Methods in Operations Research and Related Areas, Springer, Berlin, 1968.
9. A. Horn, On sentences which are true of direct unions of algebras, J. Symbolic Logic 16 (1951) 14-21.
10. P.T. Johnstone, Notes on Logic and Set Theory, Cambridge University Press, Cambridge, 1987.
11. E. Mendelsohn, Boolean Algebra and Switching Circuits, McGraw-Hill, New York, 1970.
12. N. Pippenger, Theories of Computability, Cambridge University Press, Cambridge, 1997.
13. N. Pippenger, Galois theory for minors of finite functions, Technical Report 98-08, University of British Columbia, Computer Science Department, 1998.
14. W.V. Quine, A way to simplify truth functions, Amer. Math. Mon. 62 (1955) 627-631.
15. W.G. Schneeweiss, Boolean Functions with Engineering Applications and Computer Programs, Springer, Berlin, 1989.
16. G. Szasz, Introduction to Lattice Theory, Academic Press, New York, 1963.
17. C. Wang, A.C. Williams, The threshold order of a Boolean function, Discrete Appl. Math. 31 (1991) 51-69.
18. C. Wang, Boolean minors, Discrete Math. 141 (1995) 237-258.