John C. Hansen

Learn More
Many computer science classes begin with a discussion of how a computer performs certain actions. In an introductory survey of computers, this frequently involves demonstrating some application program. A first course for majors in computer science is likely to discuss high-level programming languages and compare them to the assembly language of some(More)
Propositional calculi can be designed so as to make all logical operators unnecessary. This is done by interpreting propositions in a two-dimensional way. Atomic propositions are not only true or false 1 but are also disposed to form specific kinds of molecular propositions. i. Mul tivalent Propositions One way to generalize the combination rules presented(More)
The work habits of computer science students are rarely good. Most students adopt undesirably hermetic attitudes toward problem solving, despite the fact that large-scale programming problems demand cooperative efforts for their effective solution.This is not surprising. Students learn to write programs by working alone, and are rewarded for creating(More)
It is well known that truth functions of any number of arguments can be defined in terms of a single logical operator. Viz. either D or X, where D is read "not-both" and X is read "neither-nor. "I It is less obvious that propositional calculi can be designed so as to make all logical operators unnecessary. This can be done by asserting that propositions are(More)
  • 1