Discreet Math: Logic Terms Memory Tips

  • Thread starter Thread starter Miike012
  • Start date Start date
  • Tags Tags
    Logic Terminology
Click For Summary
Understanding conditional statements in discrete math can be simplified by focusing on the meanings of the terms involved. For instance, the relationship "q is necessary for p" translates to the logical expression P → Q, indicating that P cannot be true if Q is false. Memorizing these relationships can be easier by associating them with their English definitions. Utilizing visual aids, like diagrams or charts, may also enhance memory retention. Mastery of these concepts is crucial for success in discrete mathematics.
Miike012
Messages
1,009
Reaction score
0
For anyone who has taken discreet math are there any easy ways of remembering all the terms for the condition statement?

I added the terms in the paint doc.
 

Attachments

  • LOG.jpg
    LOG.jpg
    8.3 KB · Views: 472
Physics news on Phys.org
For me most of those are easy. For example, "q is necessary for p" means you will never have Q false and P true. So that means P → Q because this means you will never have P true and Q false, the same thing.

I suppose the easy way is to learn what the English words mean.
 

Similar threads

  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 21 ·
Replies
21
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 43 ·
2
Replies
43
Views
6K
  • · Replies 32 ·
2
Replies
32
Views
2K
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K