Rational Engineering Deductions (REDs)

x: Shape (function) combined with Opposite shape (function)

y: () z: ()...

= maintains potential closed system (function)

example:

lever (function) vs. cyclical track (function)

supported (function) vs. (unsupported) function

short-distance pressure vs. long-distance lift

extended motion (function) vs. contained cycle (function)

momentum (function) vs. momentary activation (function)

stored energy (function) vs. no batteries (function)

= maintains potential closed system (perpetual motion)

Arbitrary / Paroxysmal Deduction ('Just' Deduction):

1-d:

A then D

D then A

(A and D are opposites)

2-d:

'AB' is 'CD'

'BC' is 'DA'

'CD' is 'AB'

'DA' is 'BC'

Basically two deductions.

A and C are opposite, B and D are opposite.

similar to categorical deduction or

two-part paroxysm.

3-d:

'ABC' is 'DEF'

'BCD' is 'EFA'

'CDE' is 'FAB'

'DEF' is 'ABC'

'EFA' is 'BCD'

'FAB' is 'CDE'

Basically three deductions.

A and D are opposite.

B and E are opposite.

C and F aare opposite.

4-d:

'A conj B boolean* C conj D' OR

'A conj D boolean* C conj B'

the statement is justice of / just as:

'opp A conj opp B Opp boolean** opp C conj opp D' OR

'opp A conj opp D Opp boolean** opp C conj opp B'

Basically four deductions.

(The opposites can be nouns or adjective forms.

C must be the opposite of A,

and D must be the opposite of B).

*(for example, 'and' / 'or' / 'always' / 'never'

'rarely' / 'usually')

*(for example, 'or' / 'and' / 'never' / 'always' /

'usually' / 'rarely')

Opp Boolean must be opposite of Boolean in this case,

so the Boolean operators cannot be neutral.

Standard Categorical Deduction:

'A conj B Neutral Boolean* C conj D'

'A conj D Neutral Boolean* C conj B'

Two deductions strictly in terms of A.

Preference is given to the first and second terms.

Otherwise determined.

The second terms retain the same logic regardless of preference.

A and C are opposite.

B and D are opposite.

Conjunction of terms is primary.

*(for example 'is' , 'as is' , 'just as' , 'when' , 'so' )

Paroxysm:

problem 'ABC...' --> solution 'oppA oppB oppC...'

similar to 3-part deduction, except quantity of terms is explicitly flexible.

again, accepts noun or adjective terms.

in this case, conjunction of terms is secondary.

Deduction Using Unconventional Opposites

complexity/perfection/arbitration/ambiguity A --->

perfection/complexity/ambiguity/arbitration opposite A

This is a hand-holding version of categorical deduction

in which specific less common comparisons are preferred

for half of the deduction.

E.g. A is equivalent here to B in standard deductions.

Opposite A is equivalent to D in standard deductions.

A selection is made between A and C, so B and D need

not be selected again.