Can Basic Propositional Calculus Solve These Logical Homework Questions?

  • Thread starter Thread starter Steverino777
  • Start date Start date
Click For Summary
SUMMARY

This discussion focuses on solving logical homework questions using basic propositional calculus principles. The first question involves demonstrating that if a function f is decreasing, then f(5) < f(3) by applying the definition of a decreasing function. The second question requires explaining that if A is a subset of B and an object w is in A, then w is also in the intersection of A and B, utilizing the definition of subset and intersection. The third question confirms that if |x| > a and it is not true that x > a, then x must be less than -a, which is derived using Modus Tollendo Ponens.

PREREQUISITES
  • Understanding of basic propositional calculus
  • Familiarity with set theory concepts, specifically subsets and intersections
  • Knowledge of the properties of decreasing functions
  • Ability to apply logical principles such as Modus Ponens and Modus Tollendo Ponens
NEXT STEPS
  • Study the definition and properties of decreasing functions in calculus
  • Learn about set theory, focusing on subsets and intersections
  • Review logical principles including Universal Modus Ponens and Law of Contradiction
  • Practice applying propositional calculus to solve logical statements and proofs
USEFUL FOR

Students studying mathematics, particularly those focusing on logic, set theory, and calculus, as well as educators looking to enhance their understanding of propositional calculus applications in homework problems.

Steverino777
Messages
6
Reaction score
0
This is mostly some basic stuff, but I just want to make sure I am doing these right. I have a hard time understanding what the questions are saying sometimes.

Homework Statement


1)Explain how we may conclude that if f is a decreasing function, then f(5) < f(3)
Make reference to a logical principle. [Note- By definition, a function g is decreasing i.f.f the conditional "if x<y, then g(x)>g(y)" is true for any real numbers x and y]

2)Suppose A and B are sets and w is an object, for which it is known that A\subseteqB and w\inA. Explain how we may conclude w\in(A\capB) Make reference to a logical principle.

3)Explain why it is true that if a real number x satisfies |x|>a, but it is not the case that x > a, then x < -a must hold. Make reference to a logical principle.

Homework Equations


(p\wedgeq) -> p Law of Simplification
p -> (p\veeq) Law of Addition
[p\wedge(p ->q)] -> q Modus Ponens
[(p\veeq)\wedge ~q] -> p Modus Tollendo Ponens
[(p -> q)\wedge~q] -> ~p Modus Tollens
(p -> r) -> [(p\wedgeq) -> r]
[~p -> (q\wedge~q] -> ~p Law of Contradiction


The Attempt at a Solution


1) The definition of a decreasing function states, "if x<y, then g(x)>g(y)" is true for any real numbers x and y. By hypothsis we know f is a decreasing function, so that the preticular case of the definition, "if 5 < 3, then g(5) > g(3)" is known to be true. --That's as far as I can get using an example form the book as a guideline. I'm not sure where to go from here and which logical principle applies to this argument.--

2) --I know how to explain it but I don't know which logical principle to use.--
A\subseteq B includes all the elements in A that are also elements of B. Since it is given w\in A, by this definition w is also an element of B. A\capB includes only the elements that A and B share in common. Since w is both an element of A and B, it is one of the elements that A and B share in common, making it an element of A\capB.

3)If a real number x satisfies |x|>a, that means x < -a or x > a. It is also given that it is not the case that x > a. Therefore by Modus Tollendo Ponens we can conclude that x < -a.


If anyone could help me with finding which logical principles apply to one and two, that'd help a lot.
 
Last edited:
Physics news on Phys.org
Anybody out there who could help?
 
I could help you with number 2, you could make use of the "intersection of a subset rule." But you've got the basic idea nailed.

Edit: I think that you could use Universal Modus Ponens for #1.
 
Last edited:

Similar threads

  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
Replies
3
Views
2K
Replies
9
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 24 ·
Replies
24
Views
5K