This repository contains an implementation of concepts from first-order logic, mainly to test my understanding as I work through Christopher C. Leary's "A Friendly Introduction to Mathematical Logic".
Definition 2.4.5. If $\Gamma$ is a finite set of $\cal L$-formulas, $\phi$ is an $\cal L$-formula, and $\phi$ is a propositional consequence of $\Gamma$, then $(\Gamma, \phi)$ is a rule of inference of type (PC).
Definition 2.4.6. Suppose that the variable $x$ is not free in the formula $\psi$. Then both of the following are rules of inference of type (QR):