The Romans used
small beads called "calculi" to perform counting tasks. The word
"calculi" is the plural of the word "calculus." So it makes
sense to think that "calculus" has something to do with calculating.
Since there are many kinds of calculation, it shouldn't surprise us that
"calculus" is used in many different contexts. Let's give a
definition.
A calculus is a
language of expressions of some kind, with definite rules for forming the
expressions. There are values, or meanings, associated with the expressions,
and there are definite rules to transform one expression into another
expression having the same value.
The English
language is something like a calculus, where the expressions are sentences
formed by English grammar rules. Certainly, we associate meanings with English
sentences. But there are no definite rules for transforming one sentence into
another. So our definition of a calculus is not quite satisfied. Let's try
again with a programming language X.
We'll let the expressions be the programs written in the X language. Is this a calculus? Well, there are certainly rules for
forming the expressions, and the expressions certainly have meaning. Are there
definite rules for transforming one X
language program into another X
language program? For most modern programming languages the answer is no. So we
don't quite have a calculus. We should note that compilers transform X language programs into Y language programs, where X and Y are different languages. Thus a compiler does not qualify as a
calculus transformation rule.
In mathematics the
word "calculus" usually means the calculus of real functions. For
example, the two expressions
Dx[f (x)g(x)] and f(x)Dxg(x) + g(x)Dxf(x)
are equivalent in this
calculus. The calculus of real functions satisfies our definition of a calculus
because there are definite rules for forming the expressions and there are
definite rules for transforming expressions into equivalent expressions.
We'll be studying
some different kinds of "logical" calculi. In a logical calculus the
expressions are defined by rules, the values of the expressions are related to
the concepts of true and false, and there are rules for transforming one expression
into another. We'll start with a question.
How Can We Tell
Whether Something Is a Proof?
When we reason with
each other, we normally use informal proof techniques from our personal
reasoning systems. This brings up a few questions:
What is an informal
proof?
What is necessary
to call something a proof?
How can I tell
whether an informal proof is correct?
Is there a proof
system to learn for each subject of discussion?
Can I live my life
without all this?
A formal study of
logic will provide us with some answers to these questions. Well find general
methods for reasoning that can be applied informally in many different
situations. We'll introduce a precise language for expressing arguments
formally, and we'll discuss ways to translate an informal argument into a
formal argument. This is especially important in computer science, in which
formal solutions (programs) are required for informally stated problems.