PT Journal
AU Bucciarelli, A
   Salvo, I
TI Totality, Definability and Boolean Circuits
PY 1998
BP 808
EP 819
VL 1443
DI 10.1007/BFb0055104
AB In the type frame originating from the flat domain of boolean values, we single out elements which are hereditarily total. We show that these elements can be defined, up to total equivalence, by sequential programs. The elements of an equivalence class of the totality equivalence relation (totality class) can be seen as different algorithms for computing a given set-theoretic boolean function. We show that the bottom element of a totality class, which is sequential, corresponds to the most eager algorithm, and the top to the laziest one. Finally we suggest a link between size of totality classes and a well known measure of complexity of boolean functions, namely their sensitivity.
ER