The equivalence of the notions of independence systems and monotone boolean functions is proved. This result permits to establish some new connections between discrete analysis and discrete optimization. We discuss possible directions of research following from these connections. Some Questions connected with the reducibility of general in-dependence systems to threshold ones are also considered.