Studied by 4 peopleSyntax of propositional logic
its formal language including grammatical rules for putting together well formed formulas
Recursive definition
Gives finite way of characterising the infinite number of formulas that we can form in propositional logic
Atomic propositions
p, q, r…
Operators
Formalise to build more complex prepositions
Not symbol
¬… (negation)
And symbol
. . ∧. . .(conjunction)
Or symbol
. . ∨. . . (disjunction)
if… then symbol
. . . →. . . (implication)
if and only if symbol
. . . ↔. . . (bi-implication
Why use parenthesis ()
To avoid ambiguities in formulas
Note
Flashcard