Guide to Negating Formulas, Study notes of Logic

talking about how to negate formulas in propositional or frst-order logic. ... to fnd the negation of a formula, ... statements actually are negations.

Typology: Study notes

2022/2023

Uploaded on 02/28/2023

anala
anala 🇺🇸

4.3

(15)

259 documents

1 / 385

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Guide to Negating Formulas
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d
pf2e
pf2f
pf30
pf31
pf32
pf33
pf34
pf35
pf36
pf37
pf38
pf39
pf3a
pf3b
pf3c
pf3d
pf3e
pf3f
pf40
pf41
pf42
pf43
pf44
pf45
pf46
pf47
pf48
pf49
pf4a
pf4b
pf4c
pf4d
pf4e
pf4f
pf50
pf51
pf52
pf53
pf54
pf55
pf56
pf57
pf58
pf59
pf5a
pf5b
pf5c
pf5d
pf5e
pf5f
pf60
pf61
pf62
pf63
pf64

Partial preview of the text

Download Guide to Negating Formulas and more Study notes Logic in PDF only on Docsity!

Guide to Negating Formulas

Hi everybody!

This is a really valuable skill! If you ever need to write a proof by contradiction or a proof by contrapositive, you'll need to know how to negate formulas.

While this might seem a bit tricky at frst, the good news is that there's a nice, mechanical way that you can negate formulas!

For example.

Let's imagine that you want to negate this formula to the left.

¬ p ∧ ( q ∨ r )

And putting a negation symbol in front.

¬(¬ p ∧ ( q ∨ r ))

Technically speaking, this formula is the negation of the original formula, though it's hard to see exactly what this formula says.

¬(¬ p ∧ ( q ∨ r ))

The good news is that there are a number of rules we can use to do this.

¬(¬ p ∧ ( q ∨ r ))

If you remember from our lecture on propositional logic, we saw a series of rules for simplifying negations.

¬(¬ p ∧ ( q ∨ r ))

I'm going to write this rules up at the top of the screen.

¬(¬ p ∧ ( q ∨ r ))

¬( A ∨ B )

¬ A ∧ ¬ B

¬( A ∧ B )

¬ A ∨ ¬ B

We haven't talked about this notation before, but the good news is that it's not too bad. Let's take a look at this.

¬(¬ p ∧ ( q ∨ r ))

¬( A ∨ B )

¬ A ∧ ¬ B

¬( A ∧ B )

¬ A ∨ ¬ B

¬(¬ p ∧ ( q ∨ r ))

¬( A ∨ B )

¬ A ∧ ¬ B

¬( A ∧ B )

¬ A ∨ ¬ B

A rule like this means “if you see Before , replace it with After .”

Before

After

So let's look at this rule on the right.

¬(¬ p ∧ ( q ∨ r ))

¬( A ∨ B )

¬ A ∧ ¬ B

¬( A ∧ B )

¬ A ∨ ¬ B