3. We want to find S so ((A = B) A B) = S is a tautology. A B (A=B) A B TT ((A = B) ^ B) = S S TF FT FF (a) Explain why S can't be A. (b) Explain why S can't be ¬A. (c) Find S that makes a tautology. (d) Explain why, in this case, the statement S isn't useful. (If y wrote out simple statements A and B, the answer to this questi is obvious),

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
Question
100%

do not handwrite this.

3. We want to find S so ((A = B) A B) = S is a tautology.
AB(A=B) ^ B
TT
TF
FT
FF
S
((A = B) ^ B) = S
(a) Explain why S can't be A.
(b) Explain why S can't be ¬A.
(c) Find S that makes a tautology.
(d) Explain why, in this case, the statement S isn't useful. (If you
wrote out simple statements A and B, the answer to this question
is obvious).
Transcribed Image Text:3. We want to find S so ((A = B) A B) = S is a tautology. AB(A=B) ^ B TT TF FT FF S ((A = B) ^ B) = S (a) Explain why S can't be A. (b) Explain why S can't be ¬A. (c) Find S that makes a tautology. (d) Explain why, in this case, the statement S isn't useful. (If you wrote out simple statements A and B, the answer to this question is obvious).
Expert Solution
Step 1

Disclaimer: Since you have posted a question with multiple sub-parts, we will solve the first three sub-parts for you. To get the remaining sub-part solved please repost the complete question and mention the subparts to be solved.

A statement is a sentence that can either be true or can be false but not both at the same time. But not every sentence can be a statement. There are some rules that a sentence has to follow in order to be considered a statement.

A sentence will not be a statement if:

  • It is an exclamation.
  • It is an order or request.
  • It is a question.
  • It contains variable time.
  • It contains variable places.
  • It contains pronouns.

A simple statement is a statement that cannot be broken into multiple statements.

A compound statement is a statement containing two or more simple statements.

We use connectives to join two or more statements to form a compound statement.

There are three basic connectives used:

  1. Conjunction: It corresponds to the word 'and'.
  2. Disjunction: It corresponds to the word 'or'.
  3. Negation: It corresponds to the word 'not'.
steps

Step by step

Solved in 5 steps

Blurred answer
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,