Propositions
We start with the basic building blocks of first-order logic: propositions. The collection of propositions is simply a collection of symbols. Common ones are based on the Roman or Greek alphabets, e.g. But we could just as easily using emoji for our symbols
Right now, they have no meaning attached.
Given a set of propositions, we next need rules to combine them into expressions.
Deduction
The operations we use to combine expressions will reflect oft-occuring structures in human reason. But, we also need to model the common steps in deduction. Here there are two separate roles: assumptions we are given and goals we want to establish (if we can).
In the written (or natural) language, you might see.
Example. If and are even integers, then so is .
Recall here that the integers are
This could also be written as
Example. Let and be even integers. The integer is also an even integer.
While the latter example is not written an explicit if-then the content is the same. Our set of assumptions is and are even integers while our goal is is an even integer.
Let’s write down a proof of these statements. We can represent as a table.
Assumptions | Goal |
---|---|
even | is even |
Mathematics is well-known for compact (and difficult) notation. In a proof, it is often valuable to unfold the definitions into the statement they represent. We perform this operation on the assumptions.
Assumptions | Goal |
---|---|
for some integer | is even |
for some integer |
We also rewrite the goal in the same way.
Assumptions | Goal |
---|---|
for some integer | for some integer |
for some integer |
To achieve our goal, we want to exhibit the desired using the assumptions at hand. To make progress, we import another “known fact” into the assumptions context: distribution of multiplication over subtraction.
Assumptions | Goal |
---|---|
for some integer | for some integer |
for some integer | |
for all integers |
Now we can an apply distribution with to gain another statement and finish.
Assumptions | Goal |
---|---|
for some integer | for some integer |
for some integer | |
for all integers | |
set | |
While we modeled this proof as a table, it is notationally simpler to represent deduction from assumption to goal (with some intermediate steps) vertically.

And we write to indicate that we can prove the goal(s) given the assumption(s) .