A note on UDE's in an n-valued logic. - T. C. Wesselkamper (Notre Dame J. Formal Log., 1974)

Some classical mathematical results related to the problems of the firmware/hardware interface. - T. C. Wesselkamper (MICRO (1), 1975)

Weak completeness and Abelian semigroups. - T. C. Wesselkamper (Math. Log. Q., 1975)

A sole sufficient operator. - T. C. Wesselkamper (Notre Dame J. Formal Log., 1975)

A correction to my paper "A sole sufficient operator". - T. C. Wesselkamper (Notre Dame J. Formal Log., 1975)

No Abelian Semigroup Operation is Complete. - T. C. Wesselkamper (Math. Log. Q., 1976)

Generalized finite Post algebras. - Jon C. Muzio; T. C. Wesselkamper (MVL, 1978)

Divided Difference Methods for Galois Switching Functions. - T. C. Wesselkamper (IEEE Trans. Computers, 1978)

The algebraic representation of partial functions. - T. C. Wesselkamper (Discret. Appl. Math., 1979)

Computer Program Schemata and the Processes They Generate. - T. C. Wesselkamper (IEEE Trans. Software Eng., 1982)

Genetic Algorithm Techniques for 3-Valued Transistor Design. - Feb J. Cabrasawan; Joanna Lesniak; T. C. Wesselkamper (International Conference on Evolutionary Computation, 1994)

Searching for Complete Functions over E(3) with Small Radii. - Feb J. Cabrasawan; T. C. Wesselkamper (ISMVL, 1994)

The Radii of Sheffer Functions Over E(3). - J. Beckman; T. C. Wesselkamper (ISMVL, 1995)

Some New Results for Multiple-Valued Genetic Algorithms. - T. C. Wesselkamper; J. Danowitz (ISMVL, 1995)