I am about to start the logic module in my first year undergraduate computer science course so have been reading through the propositional logic Wikipedia page.(https://en.wikipedia.org/wiki/Propositional_calculus).
Mathematicians sometimes distinguish between propositional constants, propositional variables, and schemata. Propositional constants represent some particular proposition, while propositional variables range over the set of all atomic propositions. Schemata, however, range over all propositions. It is common to represent propositional constants by A, B, and C, propositional variables by P, Q, and R, and schematic letters are often Greek letters, most often φ, ψ, and χ.
I understand the gist of it, I am just stuck on this difference between mainly the (constants and the variables) and the schematic letters.
Additionally, if there are better resources to learn this I am more than happy to take suggestions :)
A propositional constant is an example of a statement with a definite truth value (even if you don't know what it is), such as ‘the first decimal digit of $ 2 ^ { 9 9 9 } $ is $ 6 $’ or ‘it will be sunny tomorrow’ (assuming that you can approximate this as being definitely either true or false). Since we don't want to write that out all the time, we might write it as $ A $. In some more abstract context, we might call $ A $ a propositional constant without saying what it is, much as we might write $ a x ^ 2 + b x + c $ and say that $ a $ (but not $ x $) is a constant, to show where the focus will be.
A propositional variable is a symbol that stands for a statement that can't be analysed any further using logic, but we don't know or care which statement. So maybe its something about the decimal digits of powers of $ 2 $, or maybe it's something about the weather, or maybe it's something else; it doesn't matter. It just stands for a statement. So we'll just say ‘Let $ P $ be a propositional variable’, and leave it at that.
Using propositional variables and constants, together with logical connectives like conjunction and disjunction, we can create more propositions, such as $ A \wedge P $ or $ P \mathbin \to Q $. Unlike $ A $, we don't know or care what they mean exactly; but unlike $ P $, we can analyse them; they're not atomic. These are the analogues of algebraic expressions such as $ a x ^ 2 + b x + c $.
A propositional schematic variable stands for one of the propositions above. But now we don't know or care which one; maybe it's $ A \wedge P $, maybe it's $ P \mathbin \to Q $, maybe it's something else. So we'll just call it $ \varphi $. (Although I also see things like $ \mathcal A $ for this, and overloading $ P $ is not uncommon either.)