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
Logical consequence Dummett. The accounts discussed above all yield monotonic consequence relations, i.e. ones such that if formula_10 is a consequence of formula_12, then formula_10 is a consequence of any superset of formula_12. It is also possible to specify non-monotonic consequence relations to capture the idea that, e.g., 'Tweety can fly' is a logical consequence of but not of For more on this, see Non-monotonic inference relation. Logical consequence Logical consequence (also entailment) is a fundamental concept in logic, which describes the relationship between statements that hold true when one statement logically "follows from" one or more statements. A valid logical argument