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 truth also commonly used to refer to what could more specifically be called truth-functional tautologies. Whereas a tautology or logical truth is true solely because of the logical terms it contains in general (e.g. "every", "some", and "is"), a truth-functional tautology is true because of the logical terms it contains which are logical connectives (e.g. "or", "and", and "nor"). Not all logical truths are tautologies of such a kind. Logical constants, including logical connectives and quantifiers, can all be reduced conceptually to logical truth. For instance, two statements or more are logically incompatible "if, and only if" their conjunction is logically