VI.   Argument

Deductive Logic, also known as Deductive Reasoning is a formal method of achieving an inference using Bivalent Linear Logic by the assumption of a certain conclusion which necessarily flows from a set of premises or hypothesis.

According to Bivalent Linear Logic, a deductive argument is considered valid if the conclusion follows necessarily from the premises themselves considered valid and true.

In Bivalent Linear Logic, deductive arguments are valid, or invalid, verified or unverified, never true or false.

The simplest form of Deductive Logic is called the Law of Detachment. A single conditional statement is made, and then a hypothesis (P) is stated. The conclusion (Q) is deduced from the hypothesis and the statement. The most basic form being:

(i) As P tends towards Q (P→Q)

(ii) P (Hypothesis stated)

(iii) Q (Conclusion given)

The second simplest form of Deductive Logic is called the Law of Syllogism. Two conditional statements are made concerning A, B and C. The conclusion is deduced by combining the hypothesis of one statement with the conclusion of another. The most basic form being:

(i) If A = B

(ii) And B = C

(iii) Then A = C