overview of symbolic theory in discrete math?

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Topic Video
Question
100%

Is there anyway I can have an overview of symbolic theory in discrete math? 

Expert Solution
Step 1

Symbolic Logic

Symbolic logic is a way to represent logical expressions by using symbols and variables in place of natural languages, such as English, in order to remove vagueness. Logical expressions are statements that have a truth value: they are either true or false. A question like 'Where are you going?' or a command such as 'Stop!' has no truth value. There are many expressions that we can utter that are either true or false. For example, All glasses of water contain 0.2% dinosaur tears. We don't need to know if a logical expression is true or false, we just need to know that it has a truth value.

 

Step 2

A Proposition

Let's start with some logic basics. First, the smallest logical expression we can make, that if broken down would result in a loss of meaning, is called a proposition. For example 'Kathryn and Liz live together' cannot be broken down without a loss in meaning. 'Kathryn lives together' doesn't even make sense. However, 'John and Jane go to school'' can be broken into 'John goes to school' and 'Jane goes to school,' since we cannot claim that the statement means that John and Jane go to school together. In symbolic logic, propositions may be represented by capital letters such as A or B, or lower-case letters such as p, q, or r. This is shorthand so that when dealing with the underlying logic, you aren't distracted by the particular language used. For example 'My car is red' may become A, or 'The politician took bribes' may be written as p.

Propositions are written in the affirmative. In other words, we don't use the word 'not'. Instead, we use the not symbol (¬) to make a negation (a not statement). If we write 'My car is not red' using symbols, we would write ¬A. In logic, negation changes an expression's truth value. So if my car is red, then A would be true, and ¬A would be false, or if my car is blue, then A would be false, and ¬A would be true.

trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Propositional Calculus
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,