Can someone check my logic (sentential logic)

**swtdelicaterose** · July 12th 2010, 04:18 PM

D: Dan is Married
G: George is Married
F: Fred is Married

At most one of them is married.

I figured you have just have to take the negation of the cases where two or more people are married (three cases), and the case when all of them are married. So I did this:

$\neg\left[\left(\left(G\&\left(F\&D\right)\right)\vee(G\&D)) \vee((G\&F)\vee(F\&D))\right]$

**Ackbeet** · July 12th 2010, 06:03 PM

That's one valid approach. The other valid approach would be to OR the admissible cases together:

$D\vee F\vee G\vee\neg(D\vee F\vee G).$

[EDIT]: See Plato's post below for a correction to this approach.

I think you'll find this approach more scalable, if you throw more guys into the mix!

Incidentally, because disjunction is associative, you probably don't need that many parentheses, unless your teacher is being a stickler about wff's.

**Plato** · July 13th 2010, 03:08 AM

The following is a true statement if all three were married.
$D\vee F\vee G\vee\neg(D\vee F\vee G).$

We want at most one is married.
$(\neg D \wedge \neg F \wedge \neg G) \vee (D \wedge \neg F \wedge \neg G) \vee (\neg D \wedge F \wedge \neg G) \vee (\neg D \wedge \neg F \wedge G)$ .

**avonm** · July 13th 2010, 03:21 AM

$\neg ( ( D \wedge F ) \vee (D \wedge G) \vee (F \wedge G) )$

**avonm** · July 13th 2010, 03:30 AM

remember

$(D \wedge F \wedge G) \to (D \wedge F)$
$(D \wedge F \wedge G) \to (D \wedge G)$
$(D \wedge F \wedge G) \to (F \wedge G)$

so you don't need to care of

$(D \wedge F \wedge G)$

Thread: Can someone check my logic (sentential logic)

LinkBack

Thread Tools

Display

Can someone check my logic (sentential logic)

Similar Math Help Forum Discussions

Sentential Derivation (logic) help please

sentential logic derivations?

Sentential Logic Problem

Logic Check with Set proof

Logic, please check my answer

Search Tags