Property (1) All S is P All S is PAll S are P andsome S are not P and some S are not PSome S are not P contradiction (2)All S are not P All S are not PAll S are not P andsome S are P and some S are PSome S is P contradiction (3)this S is P this S is PThis S is P andthis S is not P This S is not PThis S is not the negative proposition of the P- contradiction (1):"not" + "property proposition", which is equivalent toremoving the previous "not"and then changing the original nature proposition as follows:affirmation becomes negation, negation becomes affirmation; Everything becomes something, and something becomes everything.
Mode (1) Necessary P Necessary PDefinitely P vs.Maybe Not P Maybe Not PMaybe not P Contradiction (2)Certainly not P Certainly not Pnecessarily not P andpossible P possible PPossibly P contradictory [Mouth formula] one must be true and the other false. If one is true, it will be false, and if one is false, it will be true. [When "must P" is true, "may not P" must be false; when "must P" is false, "may not P" must be true; and vice versa. ] (1)Negative proposition of modal proposition:"not" + "modal proposition", which is equivalent toremoving the previous not, and then changing the original "modal proposition" as follows: affirmation becomes negation, negation becomes affirmation; necessity Become possible, may become inevitable. (1)"Not" before the modal proposition: When "Not" crosses "possible, inevitable; all, some", the following interchanges are carried out: Impossible= necessarilynot necessarily notnecessarily = possiblynot both= somenot noyes = none
Hypothesis P → QP → QP→Q andP ∧ ┐ QP ∧ ┐ QP ∧ ┐ Q contradicts. if P then Q if P then QIf P then Q andP and not QP and not QP and not Q are contradictory.
Joint selection (1) P ∨ QP ∨ QP∨Q and┐ P ∧ ┐ Q ┐ P ∧ ┐ Q┐ P ∧ ┐ Q is a contradiction, calledP or QP or QP or Q andnot P and not Q not P and not QNot- P and not- Q are contradictory. (2)P∧QP∧QP∧Q and┐ P ∨ ┐ Q ┐ P ∨ ┐ Q┐ P ∨ ┐ Q is a contradiction, calledP and QP and QP and Q andnot P or not Q not P or not QNot- P or not- Q is a contradiction. (3)P ∀ QP ∀ QP ∀ Q and( P ∧ Q ) ∨ ( ┐ P ∧ ┐ Q ) (P∧Q)∨(┐P∧┐Q)(P∧Q)∨( ┐ P ∧ ┐ Q ) is contradictory, we can get:P ∀ QP∀QP ∀ Q and( P ∧ Q ) (P∧Q)(P∧Q ) Contradictions.