Predicate Logic (PL) is a very well-known formal system of logic. It includes the whole of Sentential Logic (SL), which is discussed in a different module. Here, we shall discuss the basic properties of PL.
Before you start
Since SL is an important part of PL, you should make sure that you have studied SL before proceeding.
Does not presuppose any background but advances very quickly. Highly recommended if you are interested in the connections between computation, mathematics and logic. Written by the late George Boolos, a brilliant logician and philosopher at MIT: Computability and Logic
A good formal logic textbook if you want to learn about more advanced topics related to Gödel's incompleteness proof and computability theory, by Richard E. Hodel: Introduction to Mathematical Logic