Show that the conditional statement is a Tautology without using truth tables

  • Thread starter VinnyCee
  • Start date
  • Tags
    Conditional
In summary, by applying DeMorgan's Laws and other logical equivalences, the statement \left[\neg\,p\,\wedge\,\left(p\,\vee\,q\right)\right]\,\longrightarrow\,q can be simplified to \left[F\,\wedge\,\left(p\,\wedge\,\neg\,q\right)\right]\,\vee\,q. Since the first term, \left[F\,\wedge\,\left(p\,\wedge\,\neg\,q\right)\right], evaluates to false, the entire statement is equivalent to q, making it a tautology. This can be shown without using truth tables by using logical equival
  • #1
VinnyCee
489
0

Homework Statement



Show that [tex]\left[\neg\,p\,\wedge\,\left(p\,\vee\,q\right)\right]\,\longrightarrow\,q[/tex] is a tautology without using truth tables.



Homework Equations



DeMorgan's Laws, etc.



The Attempt at a Solution



[tex]\left[\neg\,p\,\wedge\,\left(p\,\vee\,q\right)\right]\,\longrightarrow\,q[/tex]

by. EX 3 (see EX 8)

[tex]\left[\neg\,p\,\wedge\,\left(p\,\vee\,q\right)\right]\,\vee\,q[/tex]

[tex]\left[p\,\wedge\,\neg\,\left(p\,\vee\,q\right)\right]\,\vee\,q[/tex]

[tex]\left[p\,\wedge\,\left(\neg\,p\,\wedge\,\neg\,q\right)\right]\,\vee\,q[/tex]

[tex]\left[\left(p\,\wedge\,\neg\,p\right)\,\wedge\,\left(p\,\wedge\,\neg\,q\right)\right]\,\vee\,q[/tex]

[tex]\left[F\,\wedge\,\left(p\,\wedge\,\neg\,q\right)\right]\,\vee\,q[/tex]

Now what?
 
Physics news on Phys.org
  • #2
there is an error in your first line

a -> b is logicaly equivlent to ~a or b
 
  • #3


To show that this conditional statement is a tautology, we need to show that it is always true, regardless of the truth values of the propositions p and q. We can do this by using logical equivalences and properties.

First, we can use the distributive property to rewrite the statement as:

\left[\left(p\,\wedge\,\neg\,p\right)\,\wedge\,\neg\,q\right]\,\vee\,\left[\left(p\,\wedge\,\neg\,q\right)\,\wedge\,\neg\,q\right]

Next, we can use the identity property to simplify the first part to \left[F\,\wedge\,\neg\,q\right], which is always false. This means that the entire first part of the statement is always false.

Then, we can use the distributive property again to simplify the second part to \left[p\,\wedge\,\neg\,q\right].

Finally, using the transitive property, we can rewrite the statement as \left[p\,\wedge\,\neg\,q\right]\,\vee\,q.

Using the commutative property, we can rearrange this to \left[q\,\vee\,p\right]\,\wedge\,\neg\,q.

Then, using the identity property, we can simplify this to \neg\,q.

Since \neg\,q is logically equivalent to q\,\longrightarrow\,q, we have shown that the original conditional statement is a tautology.
 

1. What is a tautology in terms of conditional statements?

A tautology is a statement in logic that is always true, regardless of the truth values of its individual parts. In the context of conditional statements, a tautology is a statement that is always true, no matter what the initial condition or hypothesis is.

2. Why is it important to show that a conditional statement is a tautology?

Showing that a conditional statement is a tautology is important because it demonstrates that the conclusion will always follow from the given condition, without any exceptions. This makes the statement a strong argument and it can be used as a logical tool in various fields such as mathematics, computer science, and philosophy.

3. Can a conditional statement be a tautology even if the conclusion is false?

Yes, a conditional statement can still be a tautology even if the conclusion is false. This is because a conditional statement is considered a tautology if it is always true, regardless of the truth values of its individual parts. The conclusion being false does not necessarily affect the truth value of the statement as a whole.

4. How can a conditional statement be proven to be a tautology without using truth tables?

There are various proof techniques that can be used to show that a conditional statement is a tautology without using truth tables. These include using laws of logic such as the transitive property, the distributive property, and the law of contrapositive, as well as using proof by contradiction or proof by induction.

5. Are there any specific tips for proving a conditional statement is a tautology?

One tip for proving a conditional statement is a tautology is to carefully analyze the statement and its logical structure. Look for patterns and try to simplify the statement using known laws of logic. It can also be helpful to work backwards from the conclusion to the initial condition, and to consider different scenarios or counterexamples to ensure that the statement is indeed a tautology.

Similar threads

  • Precalculus Mathematics Homework Help
Replies
2
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
6
Views
2K
  • Precalculus Mathematics Homework Help
Replies
1
Views
1K
  • Precalculus Mathematics Homework Help
Replies
2
Views
2K
  • Precalculus Mathematics Homework Help
Replies
10
Views
2K
  • Calculus and Beyond Homework Help
Replies
2
Views
1K
  • Precalculus Mathematics Homework Help
Replies
7
Views
2K
  • Calculus and Beyond Homework Help
Replies
20
Views
2K
  • Calculus and Beyond Homework Help
Replies
4
Views
11K
  • Calculus and Beyond Homework Help
Replies
1
Views
2K
Back
Top