Alfred Tarski's influence on computer science was indirect but significant in a number of directions and was in certain respects fundamental. Here surveyed is Tarski's work on the decision procedure for algebra and geometry, the method of elimination of quantifiers, the semantics of formal languages, model-theoretic preservation theorems, and algebraic logic; various connections of each with computer science are taken up.