Proving (s ^ ~p) ==> t using Sentential Calculus

  • Thread starter lizzyb
  • Start date
  • Tags
    Calculus
In summary, Sentential Calculus, also known as propositional logic, is a type of mathematical logic that focuses on the study of propositions and their validity. It uses symbols and rules to manipulate and analyze propositions. A conditional statement, such as (s ^ ~p) ==> t, can be read as "if s and not p are both true, then t is true". To prove such statements in Sentential Calculus, one would use rules of inference and logical equivalences. These rules, such as Modus Ponens and Modus Tollens, allow for valid deductions and inferences. Sentential Calculus is important in scientific research as it helps to analyze and manipulate complex statements and arguments in a systematic and rigorous manner, ensuring
  • #1
lizzyb
168
0
Question:

Using sentential calculus (with a four column format), prove that the conclusion (s ^ ~p) ==> t follows from the premises: ~(q ^ s) and q OR p. (Hint: Employ conditionalization).

Work done:
Code:
   (1)  ~(q ^ s)         P
   (2)  (~q OR ~s)     DeM (1)
   (3)  q OR p            P
   (4)  p OR ~s          Cut (2, 3)
   (5)  ~(s ^ ~p)       DeM (4)
but, of course I'm to show (s ^ ~p) ==> t.

How should I go about it? thank you.
 
Physics news on Phys.org
  • #2
contrapositive of the hypothesis seems to work! :-)
 
  • #3


To prove (s ^ ~p) ==> t, we can use conditionalization, which states that if we have a conditional statement, we can derive the consequent (t) from the antecedent (s ^ ~p) by assuming the antecedent and then proving the consequent. In this case, we can assume (s ^ ~p) and then prove t.

(1) ~(q ^ s) P
(2) (~q OR ~s) DeM (1)
(3) q OR p P
(4) p OR ~s Cut (2, 3)
(5) ~(s ^ ~p) DeM (4)
(6) s ^ ~p Assumption
(7) s Simplification (6)
(8) ~p Simplification (6)
(9) q Disjunctive syllogism (3, 7)
(10) t Modus ponens (9, 5)
(11) (s ^ ~p) ==> t Conditionalization (6-10)

Therefore, we have proven that (s ^ ~p) ==> t using sentential calculus.
 

FAQ: Proving (s ^ ~p) ==> t using Sentential Calculus

What is Sentential Calculus?

Sentential Calculus, also known as propositional logic, is a type of mathematical logic that focuses on the study of propositions, which are statements that can be either true or false. It uses symbols and rules to analyze and manipulate propositions in order to determine their validity.

What does the statement (s ^ ~p) ==> t mean?

This statement is known as a conditional statement, where s ^ ~p is the antecedent and t is the consequent. It can be read as "if s and not p are both true, then t is true". This means that when the antecedent is true, the consequent must also be true for the entire statement to be true.

How do you prove (s ^ ~p) ==> t using Sentential Calculus?

To prove this statement using Sentential Calculus, you would use the rules of inference and logical equivalences to manipulate the given propositions and show that the statement is valid. This involves breaking down the statement into smaller propositions and using rules to combine them and reach a logical conclusion.

What are the rules of inference used in Sentential Calculus?

There are several rules of inference used in Sentential Calculus, including Modus Ponens, Modus Tollens, Hypothetical Syllogism, and Disjunctive Syllogism. These rules allow you to make valid deductions and inferences based on the given propositions.

Why is it important to use Sentential Calculus in scientific research?

Sentential Calculus is important in scientific research because it allows for the analysis and manipulation of complex statements and arguments in a systematic and rigorous manner. This can help to identify fallacies and invalid arguments, and ensure that conclusions are based on logical reasoning rather than intuition or bias.

Similar threads

Replies
0
Views
360
Replies
6
Views
1K
Replies
3
Views
2K
Replies
8
Views
2K
Replies
3
Views
2K
Replies
2
Views
5K
Replies
1
Views
1K
Replies
3
Views
858
Back
Top