Discrete functions are mappings ƒ of a finite set into a lattice . Prime blocks and prime antiblocks generalize for discrete functions the well known concepts of prime implicants and of prime implicates for Boolean functions. A lattice difference operator is defined for discrete functions which, together with the concept of extended vector, allows us to derive new attractive algorithms for obtaining the prime blocks and antiblocks of a discrete function. Applications of the theory to p-symmetric Boolean functions and to transient analysis of binary switching networks are mentioned.
