Logic in computer science compelling analysis of what can be called a mechanical procedure and Kurt Gödel asserted that he found Turing's analysis "perfect." In addition some other major areas of theoretical overlap between logic and computer science are: One of the first applications to use the term Artificial Intelligence was the Logic Theorist system developed by Allen Newell, J.C. Shaw, and Herbert Simon in 1956. One of the things that a logician does is to take a set of statements in logic and deduce the conclusions (additional statements) that must be true by the laws of logic. For example, If given a logical
Is Logic Empirical? in just the same way as he argues the principle of bivalence is. To grasp why, consider why truth tables work for classical logic: first, it must be the case that the variable parts of the proposition are either true or false: if they could be other values, or fail to have truth values at all, then the truth table analysis of logical connectives would not exhaust the possible ways these could be applied. For example intuitionistic logic respects the classical truth tables, but not the laws of classical logic, because intuitionistic logic allows propositions to be other than true