On domains completely specifying Boolean functions

Articles in the same Issue

1. On transformations of sets of words over a finite alphabet which do not propagate errors
2. The automaton permutation group AS_n is generated by elements of infinite order
3. On domains completely specifying Boolean functions
4. Critical branching processes in random environment: the probability of extinction at a given moment
5. A new theorem for a critical branching process in random environment
6. Limit distributions of the number of vertices in the layers of a random forest
7. The sequential chi-square test based on s-tuples of states of a Markov chain
8. Decomposable statistics in the scheme of allocating distinguishable and indistinguishable particles to distinguishable cells