Question

if ...... is true and p(k) is true => p(k+1) is true, k >= -1 p(n) is true​

Answer 1

Answer:

Symbolic Logic

Conjunction (AND statements)

A conjunction is a compound statement formed by combining two statements using the word and . In symbolic logic, the conjunction of pp and qq is written p∧qp∧q .

A conjunction is true only if both the statements in it are true. The following truth table gives the truth value of p∧qp∧q depending on the truth values of pp and qq .

pTTFFqTFTFp∧qTFFFpqp∧qTTTTFFFTFFFF

Disjunction (OR statements)

A disjunction is a compound statement formed by combining two statements using the word and . In symbolic logic, the disjunction of pp and qq is written p∨qp∨q .

A disjunction is true if either one or both of the statements in it is true. The following truth table gives the truth value of p∨qp∨q depending on the truth values of pp and qq .

pTTFFqTFTFp∨qTTTFpqp∨qTTTTFTFTTFFF

Negation (NOT statements)

The negation of a statement pp is not pp .

The symbol ∼∼ or ¬¬ is used to denote negation.

If pp is true, then ∼p∼p is false, and vice versa.

Step-by-step explanation:

I am Lakshay soni

please follow me