Why are some logical statements not immediately obvious in proofs?

  • Context: Undergrad 
  • Thread starter Thread starter ice109
  • Start date Start date
  • Tags Tags
    Logic Proofs
Click For Summary

Discussion Overview

The discussion focuses on the challenges faced by participants in understanding certain logical statements and their implications in proofs. It includes inquiries about the non-obviousness of specific logical equivalences and seeks resources for better comprehension of mathematical logic.

Discussion Character

  • Exploratory, Homework-related, Technical explanation

Main Points Raised

  • One participant expresses confusion about why the statement \(\forall_i ~ p_i \vee q_i \Leftrightarrow (\forall_i p_i ) \vee (\forall_i q_i)\) is not a tautology.
  • The same participant questions the equivalence of \(\forall_i ~ x \in A \vee B_i\) and \(x \in A \vee \forall_i ~ x \in B_i\), noting that this was not immediately obvious to them.
  • Another participant recommends the book "How to Prove It: A Structured Approach" by Daniel J Velleman as a helpful resource for understanding logic in proofs.
  • A further contribution illustrates the logical statements \(p_i\) and \(q_i\) using specific examples to clarify the distinction between the universal quantifiers and their implications.
  • One participant acknowledges that they have figured out the example provided in the previous post.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the initial questions posed, as the discussion reflects individual struggles with understanding logical statements rather than a unified agreement on the concepts.

Contextual Notes

The discussion highlights the complexity of logical statements and their interpretations, indicating that some assumptions may not be explicitly stated, which could contribute to the confusion experienced by participants.

Who May Find This Useful

Individuals beginning to study mathematical logic or those seeking to improve their proof-writing skills may find this discussion and the suggested resources beneficial.

ice109
Messages
1,708
Reaction score
6
im just starting to write proofs and it's going well but some things aren't immediately obvious to me.

for example it is not immediately obvious to me why

[tex]\forall_i ~ p_i \vee q_i \Leftrightarrow (\forall_i p_i ) \vee (\forall_i q_i)[/tex] isn't a tautology

and it wasn't immediately obvious to me why a statement like this

[tex]\forall_i ~ x \in A \vee B_i[/tex]

isn't equivalent to

[tex]x \in A \vee \forall_i ~ x \in B_i[/tex]

although i do understand now. can someone suggest a book or an internet resource that would help me with this? i picked up an introduction to math logic book but there's so much other stuff in there and obviously with more practice i'll get the hang of it but still some ideas on how to either get it quicker or as mentioned some resources. maybe prove a bunch of these set theorems lots of different ways.
 
Physics news on Phys.org
The book "How to Prove It: A Structured Approach" by Daniel J Velleman was useful to me. The first two chapters are an easy to understand discussion of logic as it pertains to proofs.
 
anyone else?
 
Consider the statements pi= "i is an odd number" and qi= "i+ 1 is an odd number". Then for all i, pi v qi= "either i is an odd number or i+ 1 is an odd number" is true.

[itex]\forall i p_i[/itex], however, is the statement "for all i, i is an odd number" which is false. [itex]\forall i q_i[/itex] is the statement "for all i, i+ 1 is an odd number" which is also false. "false" v "false"= "false".
 
yea i figured that one out
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 24 ·
Replies
24
Views
6K
  • · Replies 21 ·
Replies
21
Views
4K