Generation of Boolean functions under the assumption of monotonicity
A. A. Voronenko, V. S. Fedorova · Moscow University Computational Mathematics and Cybernetics · 2013
The following problem is considered: finding a Boolean function such that, for any monotonic function, there are a number of tuples such that the second function is the only monotonic function coinciding with the one given on the tuples. The impossibility of this is proved. At the same time, an example of a sequence of functions is constructed such that, by presenting the values of each one, we can uniquely define a large number of functions under the assumption of their monotonicity.