Help in understanding logical statements

  • Thread starter Thread starter Ryan Dade
  • Start date Start date
AI Thread Summary
A user is struggling with logical statements after enrolling in a class without prerequisites and seeks help with two specific problems. The first problem involves deriving the statement (∀x)(If ~Mx then Mx) under the assumption (∀x)(Mx), which raises concerns about its validity due to potential contradictions. The second problem requires proving the validity of (∃x)(If Cx then Ch) and (∃x)(Cx if and only if Ch), with clarification on notation and implications provided by other participants. The discussion highlights the challenges faced by individuals with limited backgrounds in Predicate Logic and the need for clearer understanding of logical derivations. Overall, the thread emphasizes the complexities of logical reasoning and the importance of foundational knowledge in tackling such problems.
Ryan Dade
Messages
2
Reaction score
0
In lieu of taking an extra course I signed up for a class without fulfilling a prerequisite. Now I'm trying to teach myself the stuff I should have learned and am having a hard time with two problems. If anyone can help explain how to get to the solution I would appreciate it.

1.) Show that the following holds true. Derive (\forallx)(If ~Mx thenMx) with the assumption (\forallx)(Mx)

2.) Show that the following is valid.
(\existsx) (If Cx then Ch)
(\existsx) (Cx if and only if Ch)
 
Mathematics news on Phys.org
Can you clarify on notation? For if I take the ~ symbol to mean "not" then the first question seems to be of the form A \rightarrow \neg A which is a contradiction (if it's raining, it's not raining). Or perhaps you meant: \forall x(\neg\neg Mx \rightarrow Mx) ?

For the second, note that "Cx if and only if Ch" is shorthand for "(If Cx then Ch) and (if Ch then Cx)" and that one of them is already given. The other side is almost trivial: what is it you still need to prove?
 
CompuChip, notice the "with the assumption (\forallx)(Mx). The first one is really "if, for all x, Mx is true and, for all x, Mx is false, then Mx is true". Since the hypothesis is false, the statement is trivially true.
 
I'm trying to figure out how to show it. For example

Derive (\forallz)Kzz

1. (\forallx)Kxx Assumption
2. Kcc 1\forallE
3. (\forallz)Kzz 2\forallI

But I do not have a strong background in Predicate Logic so some problems are more difficult for me to get a full understanding of
 
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Thread 'Imaginary Pythagorus'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...

Similar threads

Back
Top