Studied by 9 people

0.0(0)

Get a hint

Hint

1

Syntax of propositional logic

its formal language including grammatical rules for putting together well formed formulas

New cards

2

Recursive definition

Gives finite way of characterising the infinite number of formulas that we can form in propositional logic

New cards

3

Atomic propositions

p, q, r…

New cards

4

Operators

Formalise to build more complex prepositions

New cards

5

Not symbol

¬… (negation)

New cards

6

And symbol

. . ∧. . .(conjunction)

New cards

7

Or symbol

. . ∨. . . (disjunction)

New cards

8

if… then symbol

. . . →. . . (implication)

New cards

9

if and only if symbol

. . . ↔. . . (bi-implication

New cards

10

Why use parenthesis ()

To avoid ambiguities in formulas

New cards