This is going to be the first post I'm going to write that is valid for BOTH year 1 and year 2. Just in case you get confused as to who should be reading it ;)
CNF is short for Conjunctive Normal Form. A formula is in CNF if it is True (T) or False ( _|_ ) or a conjunction of disjunctions:
Splitting a formula is not like splitting an atom, haha :)
Splitting a formula is a way of checking the satisfiability of a propositional formula – or a set of formulas. The way we do this is by considering the truth values for Boolean variables occurring in the given formula, and then simplifying the formula depending on these values.
From these simplifications, we may even discover that we don’t always need to find the truth values for all Boolean variables in the formula.
OK, first things first. I am only doing these LaM notes because i’ve been begged to do them :P
Since a lot of Propositional Logic is extremely basic, then I am going to be quick a brief on these notes. However, do note that they are slightly more advanced than what you learnt in previous years, like here: Year 1 PL
So, with this, lets get down to the nitty gritty :D
