Positively closed classes of partial Boolean functions (Q2519398)

Let \(P_2^*\) be the set of partial functions of any arity on \(\{0,1\}\). A language Pos is defined whose terms are built from variable symbols and symbols of functions from \(P_2^*\). The semantics associated with Pos uses the truth values T (true), F (false), and * (undetermined). The positive closure of a class \(Q\subseteq P_2^*\) consists of the functions \(f\) such that there is a formula \(\Phi\) of Pos such that for all \(x_1,\dots,x_n,y\), the truth values of \(\Phi(x_1,\dots,x_n,y)\) and \(f(x_1,\dots,x_n)=y\) coincide. The authors prove that there are ten positively closed classes, among which three are precomplete. In each case a positive basis is established.