Replacement in monotone Boolean networks: An algebraic perspective

  • Meurig Beynon
Session 3 Theory
Part of the Lecture Notes in Computer Science book series (LNCS, volume 181)


Replacement rules have played an important role in the study of monotone boolean function complexity. In this paper, notions of replaceability and computational equivalence are formulated in an abstract algebraic setting, and examined in detail for finite distributive lattices — the appropriate algebraic context for monotone boolean functions. It is shown that when computing an element f of a finite distributive lattice D, the elements of D partition into classes of computationally equivalent elements, and define a quotient of D in which all intervals of the form [t∧f, t∨f] are boolean. This quotient is an abstract simplicial complex with respect to ordering by replaceability. Possible applications of computational equivalence in developing upper and lower bounds on monotone boolean function complexity are indicated, and new directions of research, both abstract mathematical and computational, are suggested.


Distributive Lattice Simplicial Complex Boolean Lattice Replacement Rule Abstract Simplicial Complex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [B1]
    Beynon, W.M. Replaceability and computational equivalence in finite distributive lattices. Theory of Computation Report 61, Univ. of Warwick, 1984.Google Scholar
  2. [B2]
    Beynon, W.M. Geometric aspects of partially-ordered systems, Ph.D. thesis, King's College, Univ. of London, 1973.Google Scholar
  3. [B3]
    Beynon, W.M. Duality theorems for finitely-generated vector lattices, Proc.Lond.Math.Soc. (3) 31, 114–128, 1975.Google Scholar
  4. [B4]
    Beynon, W.M. Vector lattices freely generated by distributive lattices, Math.Proc.Camb.Phil.Soc. (81), 193–220, 1977.Google Scholar
  5. [BB]
    Beynon, W.M. & Buckle, J.F. Computational equivalence and replaceability in commutative semigroups. in preparationGoogle Scholar
  6. [B]
    Birkhoff, G.A. Lattice Theory, 3rd ed. AMS Colloquium Publications, Vol.XXV, 1967.Google Scholar
  7. [D1]
    Dunne, P.E. A 2.5n lower bound on the monotone network complexity of T3n, Theory of Computation Report 62, Univ. of Warwick, 1984.Google Scholar
  8. [D2]
    Dunne, P.E. Some results on replacement rules in monotone boolean networks, Theory of Computation Report 64, Univ. of Warwick, 1984.Google Scholar
  9. [G]
    Grätzer, G. Lattice Theory: first concepts and distributive lattices, W.H.Freeman and Co., San Francisco, 1971.Google Scholar
  10. [M]
    Mehlhorn, K. & Galil, Z. Monotone switching networks and boolean matrix product, Computing (16), 99–111, 1976.Google Scholar
  11. [P]
    Paterson, M.S. Complexity of monotone networks for boolean matrix product, Theoretical Computer Science (1), 13–20, 1975.Google Scholar
  12. [W]
    Wegener, I On the complexity of slice-functions, Internal Report, Univ. Of Frankfurt, July 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Meurig Beynon
    • 1
  1. 1.Dept. of Computer ScienceConventryUK

Personalised recommendations