Logic Syllogistic Algorithms Fedorchenko MV

1
A -gt a1. A -gt a2 A
-gt a3b1 a1 a2b2 a2 a3b3 a3 a1c1
b1 b2c2 b2 b3c3 b3 b1B -gt a1.
B -gt a2 B -gt a3b1
a1 a2b2 a2 a3b3 a3 a1d1 b1
b2d2 b2 b3d3 b3 b1C -gt a1.
C -gt a2 C -gt a3b1 a1
a2b2 a2 a3b3 a3 a1e1 b1 b2e2
b2 b3e3 b3 b1c1d1e1 conclusion
D1 conc c3D2 c3 e2 D3 e2 concA1
D1 D2A2 D2 D3A3 D3 D1A1A2A3 -gt
B1 D1 conc d3D2 d3 c2 D3 c2
concA1 D1 D2A2 D2 D3A3 D3
D1A1A2A3 -gt C1D1 conc e3D2 e3 d2
D3 d2 concA1 D1 D2A2 D2 D3A3 D3
D1A1A2A3 -gt A1 ---------------------------
----------A1C1B1e1 A1 C1e2 C1 B1e3
B1 A1d1 e1 e2d2 e2 e3d3 e3
e1d1 d2 d3 -gt Conclusion

• Balance of systems
• ?IFI? -gt ?FF? -gt?IFI?
• 2) ?FF?-gt ?IFI? -gt ?FF?
• 3) ?FF?-gt ?IFI?
• 4) ?IFI? -gt ?FF?
• ?IFI??FF?
• ?FF???IFI???II? ?IFI??IOF?

2
Syllogistics intellectum cognitumA1 ? a1, a2B1
? b1, b2A2 a1 ? b2B2 b1 ? a2A3 (a1 ? b1)
(a2 ? b2)B3 (b1 ? a2) (b2 ? a1)A A1
A2 A3B B1 B2 B3A ? B Conclusion????
???????? ?????????? ????? ??????? ??????????
???????? (XOR, AND, OR).? ????? ???????
?????????????? ????? ?????????? (A3 ? B3).? ?????
?????? ?????? ?????? ????? XOR ????? A ? B.???
?????? ??? ?????????? ??????? ?????? ?????????,
??????? ?????? ??????????? ????????? ?????
?????????? A ? B ????? ????????????? ??????.
Syllogistics Intellectum Cognitum ??? 1
??????????? ??????? ???????? A ? a1, a2, a3 b1
a1 ? a2 b2 a2 ? a3 b3 a3 ? a1 c1 (b1 ?
b2) ? b3 c2 (b2 ? b3) ? b1 c3 (b3 ? b1) ?
b2 B ? a1, a2, a3 b1 a1 ? a2 b2 a2 ? a3 b3
a3 ? a1 d1 (b1 ? b2) ? b3 d2 (b2 ? b3) ?
b1 d3 (b3 ? b1) ? b2 C ? a1, a2, a3 b1 a1
? a2 b2 a2 ? a3 b3 a3 ? a1 e1 (b1 ? b2) ?
b3 e2 (b2 ? b3) ? b1 e3 (b3 ? b1) ? b2 ??? 2
???????????? ?????????? c1 ? d1 ? e1
Conclusion ??? 3 ??????????? ??????????
????????? (D-???????) D1 Conclusion ? c3 D2
c3 ? e2 D3 e2 ? Conclusion A1 (D1 ? D2) ?
D3 A2 (D2 ? D3) ? D1 A3 (D3 ? D1) ? D2 A1
A2 A3 ? B1 D1 Conclusion ? d3 D2 d3 ?
c2 D3 c2 ? Conclusion A1 (D1 ? D2) ? D3 A2
(D2 ? D3) ? D1 A3 (D3 ? D1) ? D2 A1 A2 A3 ?
C1 D1 Conclusion ? e3 D2 e3 ? d2 D3 d2 ?
Conclusion A1 (D1 ? D2) ? D3 A2 (D2 ? D3) ?
D1 A3 (D3 ? D1) ? D2 A1 A2 A3 ? A1 ??? 4
????????? ?????????????? ? ??????????? ????? A1
C1 B1 e1 A1 ? C1 e2 C1 ? B1 e3 B1 ?
A1 d1 (e1 ? e2) ? e3 d2 (e2 ? e3) ? e1 d3
(e3 ? e1) ? e2 (d1 ? d2) ? d3 ? Final Conclusion
A B C -gt C A C2,C B C3 C C2 C3
and C ltgt C2 ltgt C3 Conclusion
A1 ? a1, a2 B1 ? b1, b2 C1 ? c1, c2 D1 ? d1,
d2 E1 ? e1, e2 A2 a1 b2 B2 b1 c2 C2
c1 d2 D2 d1 e2 E2 e1 a2 A3 a2
c1 B3 b2 d1 C3 c2 e1 D3 d2 a1 E3
e2 b1 A A1 A2 A3 B B1 B2 B3 C
C1 C2 C3 D D1 D2 D3 E E1 E2
E3 A B C D E Conclusion
3
Option 1 (Summation via alternating bonds)A2
a1 d2B2 b1 e2C2 c1 a2D2 d1 b2E2
e1 c2A3 a2 b1B3 b2 c1C3 c2
d1D3 d2 e1E3 e2 a1Option 2
(Alternating pairs)A2 a1 e2B2 b1 a2C2
c1 b2D2 d1 c2E2 e1 d2A3 a2
c2B3 b2 d2C3 c2 e2D3 d2 a2E3 e2
b2Option 3 (Summation with a shift by two
elements)A2 a1 c2B2 b1 d2C2 c1
e2D2 d1 a2E2 e1 b2A3 a2 d1B3
b2 e1C3 c2 a1D3 d2 b1E3 e2
c1Option 4 (Cyclic union via A)A2 a1 b2B2
A2 c2C2 B2 d2D2 C2 e2E2 D2
a2A3 a2 C2B3 b2 D2C3 c2 E2D3
d2 A2E3 e2 B2Option 5 (Dependency via
inverse order)A2 e1 d2B2 a1 e2C2 b1
a2D2 c1 b2E2 d1 c2A3 d2 b1B3
e2 c1C3 a2 d1D3 b2 e1E3 c2 a1
Option 6 (Summation via A1 and B1)A2 A1
b2B2 B1 c2C2 C1 d2D2 D1 e2E2 E1
a2A3 A2 c1B3 B2 d1C3 C2 e1D3
D2 a1E3 E2 b1Option 7 (Reverse logic via
the previous layer)A2 b1 c2B2 c1 d2C2
d1 e2D2 e1 a2E2 a1 b2A3 E2
b1B3 A2 c1C3 B2 d1D3 C2 e1E3 D2
a1Option 8 (Cascade merge)A2 a1 B1B2
b1 C1C2 c1 D1D2 d1 E1E2 e1
A1A3 A2 c1B3 B2 d1C3 C2 e1D3
D2 a1E3 E2 b1Option 9 (Different
coefficients in sum)A2 2 a1 b2B2 3 b1
c2C2 4 c1 d2D2 5 d1 e2E2 6
e1 a2A3 A2 2 c1B3 B2 3 d1C3
C2 4 e1D3 D2 5 a1E3 E2 6 b1
Option 10 (Cyclic dependence through previous
layers) A2 a1 E1 B2 b1 A1 C2 c1 B1 D2
d1 C1 E2 e1 D1 A3 A2 C2 B3 B2
D2 C3 C2 E2 D3 D2 A2 E3 E2 B2 Option
11 (Summation with control over E2) A2 a1
b2 B2 b1 c2 C2 c1 d2 D2 d1 e2 E2 e1
A2 A3 A2 C2 B3 B2 D2 C3 C2 E2 D3
D2 A2 E3 E2 B2 Option 12 (Summation with
feedback to the second step) A2 a1 c2 B2 b1
d2 C2 c1 e2 D2 d1 a2 E2 e1 b2 A3
E2 a2 B3 A2 b2 C3 B2 c2 D3 C2 d2 E3
D2 e2 In all options, the final result is
preserved ABCDEConclusion These algorithms
can be used to generate different types of
connections in models or computing systems.
4
Algorithm 1 Basic with Advanced LogicStep 1
Defining Basic SetsA? a1, a2, a31.1b1 a1?
a21.0b2 a2? a30.1b3 a3? a10.0b4
(a1? a3)? a2ConditionCalculation b1.1c1
(b1? b2)? b31.0c2 (b2? b3)? b10.1c3 (b3?
b1)? b20.0c4 (b1? b3)? (b2?
b4)ConditionCalculation cB? a1, a2,
a3ConditionCalculation b1.1b1 a1?
a21.0b2 a2? a30.1b3 a3? a10.0b4 (a1?
a2)? a3ConditionCalculation d1.1d1 (b1? b2)?
b31.0d2 (b2? b3)? b10.1d3 (b3? b1)?
b20.0d4 (b2? b4)? (b1? b3)C? a1, a2,
a3ConditionCalculation b1.1b1 a1?
a2ConditionCalculation b1.0b2 a2? a30.1b3
a3? a10.0b4 (a1? a3)? a2ConditionCalculatio
n e1.1e1 (b1? b2)? b31.0e2 (b2? b3)?
b10.1e3 (b3? b1)? b20.0e4 (b1? b4)? (b2?
b3)Step 2 Formation of Conclusion(c1? d1?
e1)? (c2? d2)? (c3? d3? e2) ConclusionStep 3
Extended Transition Sets (D-Level)Condition1.1
Calculation of DD1 Conclusion? c41.0D2 c3?
e20.1D3 e2? Conclusion0.0D4 (e3? c2)?
(d1? d3)
A1 (D1? D2)? D3A2 (D2? D3)? D1A3 (D3?
D1)? D2A1 A2 A3? B1Final transformation
and outputA1 C1 B1e1 A1? C1e2 C1?
B1e3 B1? A1d1 (e1? e2)? e3d2 (e2? e3)?
e1d3 (e3? e1)? e2(d1? d2)? d3?Final
ConclusionAlgorithm 2 Advanced (second level
of complexity)This algorithm uses even more
complex relationships, expanding the interactions
of elements.Step 1 Forming sets with extended
operationsA? a1, a2, a3b1 (a1? a2)? (a2?
a3)b2 (a2? a3)? (a1? a3)b3 (a3? a1)? (a2?
a1)c1 (b1? b2)? (b3? b1)c2 (b2? b3)? (b1?
b2)c3 (b3? b1)? (b2? b1)B? a1, a2, a3b1
(a1? a2)? (a2? a3)b2 (a2? a3)? (a1? a3)b3
(a3? a1)? (a2? a1)d1 (b1? b2)? (b3? b1)d2
(b2? b3)? (b1? b2)d3 (b3? b1)? (b2? b1)C?
a1, a2, a3b1 (a1? a2)? (a2? a3)b2 (a2?
a3)? (a1? a3)b3 (a3? a1)? (a2? a1)e1 (b1?
b2)? (b3? b1)e2 (b2? b3)? (b1? b2)e3 (b3?
b1)? (b2? b1)Final Conclusion(c1? d1? e1)?
(c2? d2)? (c3? d3? e2)?Final Conclusion
Syllogistics Intellectum Cognitum (Advanced
Edition)Step 1 Defining Basic SetsA1? a1,
a2B1? b1, b2ConditionComputing A2 and
B21.1 A2 a1? b21.0B2 b1? a2ConditionComputin
g A3 and B31.1 A3 (a1? b1) (a2? b2)1.0 B3
(b1? a2) (b2? a1)A A1 A2 A3B B1 B2
B3A? B ConclusionStep 2 Introducing
Complex Logical OperationsAdding AND, OR, XOR at
a deeper levelCondition1.1Additional
calculationsA4 (A2? B3)? (A3? B2)1.0B4
(B2? A3)? (B3? A2)0.1A5 (A3? B1)? (B2?
A1)0.0B5 (B3? A2)? (A1? B1)A A1 A2 A3
A4 A5B B1 B2 B3 B4 B5A? B
ConclusionStep 3 Advanced level of
interactionsConditionDeeper analysis of A and
B1.1 A6 (A4? B5)? (A5? B4)1.0 B6 (B4? A5)?
(B5? A4)A A1 A2 A3 A4 A5 A6B B1
B2 B3 B4 B5 B6(A? B)? (A4? B5)
Final Conclusion
5
Lets define three sets of initial inputs, which
we will label as X, Y, and Z instead of A, B, and
C. Each set will have three elements. X x1, x2,
x3 Y y1, y2, y3 Z z1, z2, z3 For Set X u1
x1 x2 u2 x2 x3 u3 x3 x1 For Set Y v1
y1 y2 v2 y2 y3 v3 y3 y1 For Set Z w1
z1 z2 w2 z2 z3 w3 z3 z1 Combining X
and Y p1 u1 v1 p2 u2 v2 p3 u3
v3 Combining Y and Z q1 v1 w1 q2 v2
w2 q3 v3 w3 Combining Z and X r1 w1
u1 r2 w2 u2 r3 w3 u3 Step 4 Derive Final
Combinations Now, we will derive final
combinations that will lead us to our
conclusion. Final Combinations s1 p1 q1 s2
p2 q2 s3 p3 q3 Step 5 Conclusion
Derivation Finally, we will derive the conclusion
based on the final combinations. Conclusion s1
s2 s3 Conclusion The Truth Derivation
Algorithm (TDA) provides a structured and
systematic approach to deriving conclusions from
sets of data, while introducing new variables and
combinations. This method can be adapted and
expanded for various applications, ensuring
flexibility and robustness in logical reasoning
and conclusion generation.
Initial Equation A B C Derived Values The
12 variants demonstrate various possibilities for
f and g (addition, subtraction, multiplication,
division, modulo, min/max, powers, etc.). C2
f(A, B, C) C3 g(A, B, C) Conclusion h(C, C2,
C3) and/or a condition based on relationships
between C, C2, and C3.
6
If X gt 0 , X affects the total sum
If P-gtproblem gt -P jr P -gt P1 and P2, P1-problem
and P2 not problem gt P-gt P2
Algorithm for solving a problem. If an action
leads to a problem, we should invert it to solve
the problem. P -gt problem gt not P or P ! Q gt Q
-gt solving.
Quantum Logic false 0 -gt1, Formal0 and 1 -gt 1,
true 1-gt 1 0 and 0 -false it 1 , 0 and 1 -formal
or Neutral it 1 and 0, 1 and 1 -true it 1.
Opportunities are multiplied by the measure of
their use. U'Unwhere U' is the new value of
used opportunities, U is the available
opportunities and n is the number of used
opportunities.
True true false -gttrue False false true
-gt false gt Verity true false.
Everything can exist, but only in conformity
with the laws of its proper structure, place,
time and position, among all existing
things. p?q p -gt true q -gt true in relation to
the value p gt0 q gt0 -gt p?q gt pq -gt r
Syllogistics intellectus cognitum. Syllogism
solveng contradictions. Solomon's solution. if p
? q gt if pgt0 and qgt0 gt pq if pgt0 and q0 gt p
and if p0 and qgt0 gtq
Syllogistics intellectus cognitum Syllogism
solving problem Problem -gt divide task1,
task2, task3, task4, task5. task1 -gt solution
1 task2 -gt solution 2 task3 -gt solution 3 task4
-gt solution 4 task5 -gt solution 5 sol 1 sol 2
-gt conclusion 1 sol 2 sol 3 -gt conclusion 2 sol
3 sol 4 -gt conclusion 3 sol 4 sol 5 -gt
conclusion 4 sol 5 sol 1 -gt conclusion 5 sol 1
sol 3 -gt conclusion 6 sol 1 sol 4 -gt
conclusion 7 sol 2 sol 4 -gt conclusion 8 sol 2
sol 5 -gt conclusion 9 sol 3 sol 5 -gt
conclusion 10 -gt Problem
Syllogistics intellectus cognitum Syllogism
solving problem Problem -gt divide task1,
task2, task3, task4. Task1 task2 -gt solution
1 Task2 task3-gt solution 2 Task3 task4-gt
solution 3 task4 task1-gt solution 4 -gt
Solution -gt Problem
7
Syllogistics intellectus cognitum A-gtw1 A-gtw2 A-gtw
3 ..... w12 w1 gt wx gt wy .... gtwn w1 -gt wx -gt
wy .... -gt wn Quote Synthesis
Syllogistics intellectus cognitum A-gtv1, v1-gtp1
n1- p1n1-gtc1 A-gtv2, v2-gtp2 n2-
p2n2-gtc2 c1 gt , lt , , ?, c2
Syllogistics intellectus cognitum Finding a
logical error. Syllogism p -gt -q and q fact
contradict -q, Yes or No fact contradict q, Yes
or No if -q and q Yes gt -q gtlt q
Syllogistics intellectus cognitum A-gtv1, v1-gtp1
n1- p1n1-gtc1 A-gtv2, v2-gtp2 n2-
p2n2-gtc2 c1 gt , lt , , ?, c2
Syllogistics intellectus cognitum Truth
judgement A-gtp1() A-gtp2(-) A-gtp3() A-gtp4(!) p1p
2-gtc1 p2p3-gtc2 p3p4-gtc3 p1p3-gtc4 p1p4-gtc5 p2p
4-gtc6 c1c2-gtcd1 c3c4-gtcd2 c5c6-gtcd3 cd1cd2cd3
-gt truth judgement
Syllogistics intellectus cognitum Finding a
logical error. Syllogism p -gt -q and q fact
contradict -q, Yes or No fact contradict q, Yes
or No if -q and q Yes gt -q gtlt q
Syllogistics intellectus cognitum  Law of
Syllogism True S point view  p1 true
false  p2 true false p3 true false S
(true false) (true false) ( true false)
-gt  true not contradict true true not contradict
fact false controdict fact false controdict false
Syllogistics intellectus cognitum Verity f1
f2 f3 f4 f5 f6 f7 f8 f - fact c -
conclusion c1f1f2 c2f2f3 c3f3f4 c4f4f5 c5
f5f6 c6f6f7 c7f7f8 c8f8f1 cd - conclud t
1- truth cd1c1c2 t1-1c2c3 cd2c3c4 t1-2c4c5
cd3c5c6 t1-3c6c7 cd4c7c8 t1-4c8c1 t -
truth t1(cd1cd2)?t1-1 t2(cd2cd3)?t1-2 t3(cd
3cd4)?t1-3 t4(ce4cd1)?t1-4 v - verity v
t1t2t3t4.
Syllogistics intellectus cognitum ??????? ??????
(??????????). Solving dilemmas (paradoxes). A-gtp1
A-gtp2 p1?p2 -gt p1p2p3-gt Ap3 A-gtp3
Syllogistics intellectus cognitum Syllogism if p
-gt true and false gt Relative gt p Context
8
Version 1 Adding XOR and AND/OR Syllogistics
Intellectum Cognitum A S A ? int p1 A ? int
p2 A ? int p3 Triangle 1 (p1 ? p2) (p2 ?
p3) (p1 ? p3) int v1 p1 ? p2 int v2 p2 ?
p3 int v3 p1 ? p3 Triangle 2 (v1 v2) ?
(v2 ? v3) (v1 ? v3) int x1 v1 ? v2 int x2
v2 ? v3 int x3 v1 ? v3 Triangle 3 (x1 ?
x2) (x2 ? x3) (x1 ? x3) Triangle 1
Triangle 2 Triangle 3 Conclusion Version 2
Introducing Additional Variables and AND-OR
Logic Syllogistics Intellectum Cognitum A S A
? int p1 A ? int p2 A ? int p3 A ? int
p4 Triangle 1 (p1 ? p2) ? (p3 ? p4) (p1
p3) int v1 p1 ? p2 int v2 p3 ? p4 int v3
p1 p3 Triangle 2 (v1 v2) ? (v3 ? p4) int
x1 v1 ? v2 int x2 v3 ? p4 int x3 p1 ?
p2 Triangle 3 (x1 ? x2) (x2 ? x3) Triangle
1 Triangle 2 Triangle 3 Conclusion Version
3 Deep Analysis via Combined Logical
Functions Syllogistics Intellectum Cognitum A
S A ? int p1 A ? int p2 A ? int p3 Triangle 1
(p1 ? p2) (p2 ? p3) int v1 (p1 ? p2) ? (p2
? p3) int v2 (p3 ? p1) ? (p1 ? p2) Triangle
2 (v1 v2) ? (v2 ? p3) int x1 (v1 ? v2)
(v2 ? p3) int x2 (p3 ? v1) ? (v2
p1) Triangle 3 (x1 ? x2) (x2 ?
p1) Triangle 1 Triangle 2 Triangle 3
Conclusion
For brevity, here are the short changes in the
following versions Version 4 Addition of four
variables p1, p2, p3, p4 Introduction of NAND and
NOR operations Version 5 Introduction of a logic
circuit with XOR-AND-OR Using additional
variables to modify triangles Version 6 Addition
of dynamic changes to triangles via add.
coefficients Using the MAJORITY and MINORITY
logical functions Version 7 Introducing loop
logic into triangles Connecting between levels
via an additional XOR operator Version 8 Forming
hidden connections via complex logical
permutations Introducing "reverse calculation"
relations Version 9 In-depth analysis via
Boolean functions Using bit mask logic Version
10 Introducing connections with a recursive
model Advanced connections between levels Version
11 Interacting with the Half-Adder
operation Using XOR-AND-OR combinations in three
levels Version 12 Dynamic redistribution of
elements at each stage Logical formulas close to
cryptographic algorithms
A S ? ? int t1 ? ? int t2 ? ? int t3 t 1 (t1
t2 t3) int v1 t1 t2 int v2 t2
t3 int v3 t1 t3 t 2 (v1 v2 v3) int x1
v1 v2 int x2 v2 v3 int x3 v1 v3 t
3 (x1 x2 x3) class Talent def
__init__(self, t1, t2, t3) self.t1 t1
self.t2 t2 self.t3 t3
def level_1(self) return self.t1
self.t2 self.t3 def level_2(self)
v1 self.t1 self.t2 v2 self.t2
self.t3 v3 self.t1 self.t3
return v1 v2 v3 def level_3(self)
x1 (self.t1 self.t2) (self.t2
self.t3) x2 (self.t2 self.t3)
(self.t1 self.t3) x3 (self.t1
self.t2) (self.t1 self.t3) return x1
x2 x3 def conclusion(self)
return self.level_1() self.level_2()
self.level_3() def is_talented(self)
return "Talented in everything" if
self.conclusion() gt 0 else "Needs improvement"
?????? ????????????? talent Talent(3, 4,
5) print(talent.is_talented())
9
Syllogistics intellectum cognitum AS ??int p1
?? int p2 ??int p3 Triangle 1 (p1
p2p3) int v1 p1 p2 int v2 p2 p3 int
v3 p1 p3 Triangle 2 (v1 v2v3) int x1 v1
v2 int x2 v2 v3 int x3 v1
v3 Triangle 3(x1 x2 x3)Trangel 1 Trangel 2
Trangel 3 conclution ?????????
?????Triangle1Triangle2...TrianglenConclusio
??????? ??????AConclusio
Syllogistics intellectus cognitum Cause-and-effect
relationship Afact A-gtc1 A-gtc2 A-gtc3 A-gtc4
c1c2c3c4c c1c2-gtR1 c2c3-gtR2 c3c4-gtR3 c4c1-
gtR4 R1R2R3R4R R1R2-gtP1 R2R3-gtP2 R3R4-gtP3 R4
R1-gtP4 P1P2P3P4P P1P2-gtr1 P2P3-gtr2 P3P4-gtr
3 P4P1-gtr4 r1r2r3r4r Agtcgt
Syllogistics intellectus cognitum Syllogism if
p(-a)-gt if p -gt true if p -gt T-a and 0a gt
-a if p -gt 0-a and Ta gt a if p -gt T-a and Ta
gt p -gta if p -gt 0-a and 0a gt a ????? ????????
??????? ? ????????? - ?????????
? ???????????? (???????????? ???????????). Any
action leading to change is factual and material
(fixed by change). All Act-gt -a-gt -a or a
gtAct-gt1gttrue
Syllogistics intellectus cognitum Law of
Syllogism Syllogism if a and b -gt true c -gt T
ab gt ab-gtd gt dc if a and b -gt true c -gt 0
ab gt ab-gtd gt d?c if a-gt true , b-gtfalse and
c-gtTagt d ac if a-gt true , b-gtfalse and
c-gt0agt d bc if a and b -gt false and c-gtT
abgt d (ab)c if a and b -gt false and c-gt0
abgt d (ab) gt dc
Syllogistics intellectus cognitum Syllogism if
p(-a)-gt if p -gt true if p -gt T-a and 0a gt
-a if p -gt 0-a and Ta gt a if p -gt T-a and Ta
gt p -gta if p -gt 0-a and 0a gt a ????? ????????
??????? ? ????????? - ?????????
? ???????????? (???????????? ???????????). Any
action leading to change is factual and material
(fixed by change). All Act-gt -a-gt -a or a
gtAct-gt1gttrue
Syllogistics intellectus cognitum Syllogism
testing for logical contradictions. p1, p2, p3,
p4, ..... pn p1 p2 p3 p4 -gta if a -gt false
gt logic contradict. if a -gt true gt logic not
contradict.
Syllogistics intellectus cognitum p1 ? a p1 ?
d ad -gt r p1 ? r rational Reasoning Without
Russia there will be no peace. Without Russia
there will be no Wealth. Peace and wealth
is life.Without Russia there will be no life. p2
? a p2 ? d ad -gt r p2 r irrational
Reasoning Without Russia there will be no Peace.
WithoutRussia there will be no Wealth. Peace and
Wealth is Life.Without Russia there will be Life.
Syllogism if p not Expression valid-gttrue if p
Expression gt p not valid- gtfalse
10
Syllogistics intellectus cognitum if p ? q p -gt
true gt q -gt false if p q p -gt true gt q -gt true
Syllogistics intellectus cognitum Syllogism
Truth abcd - gt true abc?d gt abc -gt
true/d ab?cd gt ab gt or lt cd gt 1gt0 -gt 1
true ab?c?d gt if ab gt or lt c gt or lt d max/n
-gt true min-gt false a?b?c?d-gt false
Syllogistics intellectus cognitum ab-gtcgt(ac)(b
c)-gtdgt(ad)(bd)- gtsconclusion
Syllogistics intellectus cognitum if p gt q- if
p q, p gt q if p ? q, p gt q-
Syllogistics intellectus cognitum p q pq -gt c
-gttrue gt p and q -gt true p ? q pq -gt c -gttrue
or false. gt p -gt true or false q -gt true or
false if pgt0 -gt true q 0 -gt false or p gt q -gt
pgt true and qgt false.
?-gt? irrational answer - end ?-gt! rational
answer valid
Syllogistics intellectus cognitumSyllogism C
(p1p2) or (p1p3) gt if p1p2 f 0-gt
false if p1p3 f gt 0 -gt true gt C (false)
or ( true)
Syllogistics intellectus cognitumSyllogism C
(p1p2) or (p1p3) gt if p1p2 f 0-gt
false if p1p3 f gt 0 -gt true gt C (false)
or ( true)
Syllogistics intellectus cognitum Syllogism
Eternity. p -gt q p -gt c gt c -gt q
Syllogistics intellectus cognitum Law of
Syllogism ???O? if true false 1 -gt true.
Syllogistics intellectus cognitum Syllogism
value. XXX -gt X or 3X -gt1X XAX -gt 2B or 2X1A
-gt2B
Which model is evolutionarily more successful
true false -gt true or true false -gt
false. GPT 3.5 Turbo The "true false -gt
true" model will be evolutionarily more
successful because it then produces the
correct result in more situations. The success of
a model depends on its ability to
correctly predict outcomes and draw conclusions
based on input data. Google Gemini true false
-gt true. Openchat Aura true false -gt true.
Syllogistics intellectus cognitum Law of
Syllogism if p-gta if q-gtr if a -gt true and r
-gttrue gt a-gtr or r-gta gt p-gtq
That statement whose conclusion does not
contradict the consensuses of different points of
view is true. ??????? ?????????? ???????? a -gt
x b -gt y c -gt z d -gt f x1y1z1f1 -gti if p -gt q
T i gt p -gt true
Syllogistics intellectus cognitum Law of
Syllogism Syllogism ???? ??????????? ?????????
???????? ? ????? ?? ???????????? ??????
?????????????? ??????, ?? ??? ???????. if p ? or
-gt a T b?,c?,d?,f?, p-gt true if p or -gta
0 b?,c?,d?,f? p-gt false If a statement is
verifiable and the conclusion does not contradict
other verified facts, then it is true.
Syllogistics intellectus cognitum Law of
Syllogism ?????? ((??????????? ????????
??????????? ???????????) - (??????????????
???????? ?????????????? ???????????)) /
?????????????? ???????? 100 Error
((Actual Value Actual Consequences)
- (Estimated Value Estimated Consequences)
/ Estimated Value 100
Syllogistics intellectus cognitum Law of
Syllogism ???O? ????? ???????? ???? ?????
??????, ???? ?? ???????? ?????? ????. To prove a
point, you have to prove it to yourself. (P ? Q)
? (Q ? P), ??? P ????? ?????? ????????
?????? ???? Q ????? ?????? ???????? Where
P a your point of view is proved to own self
Q the point is proven
Syllogistic intellectus cognitum Law of
Syllogism ???O? ?O? Rule for obtaining True
conclusion and judgment from one viewpoint In
order to obtain a true conclusion from a single
viewpoint, we need to represent the single
viewpoint in two views 1 - Received viewpoint, 2
- Model the inversion of the viewpoint, and
compare in three categories 1 - Value, 2
- Adequacy, 3 - Validity. if p -gt p- gt value
p gtlt p-, adeqvat p gtltp-, valid pgtltp-.
11
Syllogistics intellectus cognitum Law of
Syllogism ???O? ???? ? ?????????, ?? ? ????
???????. ???? ? ?? ?????????, ? ?? ????
???????. ? ????? gt ? ?????????. if p -gt q if
p- -gt -q if fact -gtq gt p If I exist, I can
think. If I do not exist, I cannot think. I think
gt I exist.
Syllogistics intellectus cognitum Law of
Syllogism if p q -gt a -gt false or problem
gt a -gt -a gt true or solution -a -gt a gt true
or solution
Syllogistics intellectus cognitum Law of
Syllogism Critical thinking (S - Influence) gtlt
(S Influence) Influence of each element in
total to the target. Influence 1- Yes, 0.5 -
Neutral 0- No
Syllogism if P -gt false gt -P -gt true if P -gt
false gt P ! Q gt Q -gt true
Syllogistics intellectus cognitum Syllogism of
Rule. p true not 100 false not 0 if p p2
..... pn ( The more n ) the true 0 -gt 1, to
false 1 -gt 0 Every judgment of one point of view
contains both truth and falsehood, right and
wrong in its degree, adding to it negative and
positive judgments about the judgment of other
points of view, its correctness increases, and
its falsity tends to zero.
Syllogistic intellectus cognitum Syllogism 1)
????? ??? ???????????, ????? ? ??????? ????????,
??? ????. 2) ?????? ???????????, ???? - ??????
?????. 1) When there are no alternatives, the
choice and decision is obvious,it's one. 2) Truth
is real, falsehood is empty space. if P1 and
q0, a0, gt P if Pgt0, qgt0, agt0 gt Pgtq and qgta
gt P
Syllogistics intellectus cognitum ÏSyllogistic
data validationÏ A -gt B or -B B-gtC -B-gtDÏ if
Atrue, gt Ctrue.Ïif Afalse, gt Dtrue.
Syllogistics intellectus cognitum Syllogism if
P gt -P. Pgt-P gt P, Plt-Pgt -P paradox P -Pgt
P(-P)-gt q true or Pgt0 and -Pgt0 or P ! 0 -P
!0 gt P(-P) -gtq true.
Syllogistics intellectus cognitum This describes
the process from the initial parameters (charge,
potential, mass, time and velocity) to the result
(energy or state of the system).
((q?V)?E)?((E?L)?F)?((v?t)?L)?((m?v)?P)?((q?V)?(m?
v)?(F?L)?R) (q?V)?E If there is charge and
potential, then energy arises (E?L)?F If there
is energy and distance, then work can be done
(force acts) (v?t)?L If there is speed and
time, then distance can be calculated (m?v)?P I
f there is mass and speed, then momentum
arises The result is the energy of the system,
including entanglement, forces and
momentum ((q?V)?(m?v)?(F?L))?R where R is the
final result of the system (e.g. energy or state
of a quantum system).
Syllogistics intellectus cognitum God created
the World ? God is omnipotent over the
World B?W(B) This means that if God created the
World, then He has omnipotence over it. The Clan
created the State ? The Clan is omnipotent over
the State R?W(R) If the Clan created the State,
then it has full power over it. The President is
a Manager (since he did not create the State, but
was appointed) P?M(P) The President is not the
creator of the State, which means his role is to
manage it as a Manager. P?W(R) The President
acts under the authority of the one who appointed
him.
Syllogistics intellectus cognitum To achieve
maximum influence, you can use the
following I(VP) and S?f(V) and A?f(I) This
means that Meaning and potential together form
influence. Status depends on meaning. Authority
depends on influence. Influence obtained through
status not done through its meaning and potential
is destructive to systems.
12
??int p1 ?? int p2 ??int p3 Triangle(p1
p2p3) int v1 p1 p2 int v2 p2 p3 int
v3 p1 p3 Triangle(v1 v2v3) int x1 v1
v2 int x2 v2 v3 int x3 v1
v3 Triangle(x1 x2 x3)
B?int p1 B? int p2 B?int p3 Triangle(p1
p2p3) int v1 p1 p2 int v2 p2 p3 int
v3 p1 p3 Triangle(v1 v2v3) int x1 v1
v2 int x2 v2 v3 int x3 v1
v3 Triangle(x1 x2 x3)
D?int p1 D? int p2 D?int p3 Triangle(p1
p2p3) int v1 p1 p2 int v2 p2 p3 int
v3 p1 p3 Triangle(v1 v2v3) int x1 v1
v2 int x2 v2 v3 int x3 v1
v3 Triangle(x1 x2 x3)
int v1 (Ax3Bx2) (Dx3Bx1) int v2 (Dx3Bx1)
(Dx2Ax1) int v3 (Dx2Ax1) (Ax3Bx2)
Triangle(v1 v2v3) int x1 v1 v2 int x2
v2 v3 int x3 v1 v3 Triangle(x1 x2
x3) int p1 x1 x2 int p2 x2 x3 int p3
x1 x3 Triangle(p1 p2p3) C1Dx1Ax2Bx3 Clt-i
nt p1 Clt- int p2 Clt-int p3 CltgtC1
13
??int p1 ?? int p2 ??int p3 Triangle(p1
p2p3) int v1 p1 p2 int v2 p2 p3 int
v3 p1 p3 Triangle(v1 v2v3) int x1 v1
v2 int x2 v2 v3 int x3 v1
v3 Triangle(x1 x2 x3)
B?int p1 B? int p2 B?int p3 Triangle(p1
p2p3) int v1 p1 p2 int v2 p2 p3 int
v3 p1 p3 Triangle(v1 v2v3) int x1 v1
v2 int x2 v2 v3 int x3 v1
v3 Triangle(x1 x2 x3)
int v1 (Ax3Bx2) Bx1 int v2 Bx1 Ax1 int
v3 Ax1 (Ax3Bx2) Triangle(v1 v2v3) int x1
v1 v2 int x2 v2 v3 int x3 v1
v3 Triangle(x1 x2 x3) int p1 x1 x2 int
p2 x2 x3 int p3 x1 x3 Triangle(p1
p2p3) C1Ax2Bx3 Clt-int p1 Clt- int p2
Clt-int p3 CltgtC1
14
X-gtint a1 X-gtint a2 X-gtint a3 Triangle(a1 a2
a3) int b1 a1 - a2 int b2 a2 - a3 int b3
a1 - a3 Triangle(b1 b2 b3) int y1 b1 -
b2 int y2 b2 - b3 int y3 b1 -
b3 Triangle(y1 y2 y3) int z1 y1 - y2 int
z2 y2 - y3 int z3 y1 - y3 Triangle(z1 z2
z3)
Y-gtint a1 Y-gtint a2 Y-gtint a3 Triangle(a1 a2
a3) int b1 a1 - a2 int b2 a2 - a3 int b3
a1 - a3 Triangle(b1 b2 b3) int y1 b1 -
b2 int y2 b2 - b3 int y3 b1 -
b3 Triangle(y1 y2 y3) int z1 y1 - y2 int
z2 y2 - y3 int z3 y1 - y3 Triangle(z1 z2
z3)
int b1 (Xy3 - Yz2) - Yz1 int b2 Yz1 -
Xy1 int b3 Xy1 - (Xy3 - Yz2) Triangle(b1 b2
b3) int y1 b1 - b2 int y2 b2 - b3 int y3
b1 - b3 Triangle(y1 y2 y3) int a1 y1 -
y2 int a2 y2 - y3 int a3 y1 -
y3 Triangle(a1 a2 a3) Z1 Xy2 -
Yz3 Zlt-int a1 Zlt-int a2 Zlt-int
a3 ZltgtZ1 include ltiostreamgt include
ltcmathgt using namespace std // Click on the
following int optimize(int input) cout ltlt
"The name of the text appears " ltlt input ltlt
endl return (input gt 0) ? input 2 input /
2 // It's time to see what you want and see.
More double analyze(int x, int y) cout ltlt
"?????? ?????? x " ltlt x ltlt ", y " ltlt y ltlt
endl double mean (x y) / 2.0 double
variance (pow(x - mean, 2) pow(y - mean, 2))
/ 2.0 double stddev sqrt(variance) cout ltlt
"??????? ???????? " ltlt mean ltlt endl cout ltlt
"????????? " ltlt variance ltlt endl cout ltlt
"??????????? ?????????? " ltlt stddev ltlt endl
return mean // Read more int optimized_result
optimize(Z1) double analysis_result
analyze(a1, a2) cout ltlt "????????????????
????????? " ltlt optimized_result ltlt endl cout ltlt
"????????? ??????? " ltlt analysis_result ltlt endl
15
include ltiostreamgtinclude ltcmathgtinclude
ltvectorgtusing namespace std// Function to
calculate mean in circle structureint
Circle(const vectorltintgt values) int sum
0for (int val values) sum valreturn sum
/ values.size()// Optimize value with
adaptive scalingint optimize(int input) cout
ltlt "Optimize input value " ltlt input ltlt
endlreturn (input gt 10) ? input 1.5 input /
2// Data analysis with mean, variance, and
standard deviationvoid analyze(int x, int y, int
result) double mean (x y) / 2.0double
variance (pow(x - mean, 2) pow(y - mean, 2))
/ 2.0double stddev sqrt(variance)cout ltlt
"\n Data Analysis \n"cout ltlt "x " ltlt x
ltlt ", y " ltlt y ltlt endlcout ltlt "Mean " ltlt
mean ltlt endlcout ltlt "Variance " ltlt variance ltlt
endlcout ltlt "Standard Deviation " ltlt stddev ltlt
endl// Solution variability after analysisif
(stddev gt 5) result optimize(mean)cout ltlt
"Value optimization selected." ltlt endl else
result mean 2cout ltlt "Mean doubling
selected." ltlt endlint main() vectorltintgt
values(3) cout ltlt "Enter three values " for
(int val values) cin gtgt val int c1
Circle(values) cout ltlt "Circle(a1, a2, a3) "
ltlt c1 ltlt endl vectorltintgt differences
values0 - values1, values1 - values2,
values0 - values2 int c2
Circle(differences) cout ltlt "Circle(b1, b2, b3)
" ltlt c2 ltlt endl vectorltintgt
second_differences differences0 -
differences1, differences1 - differences2,
differences0 - differences2 int c3
Circle(second_differences) cout ltlt "Circle(y1,
y2, y3) " ltlt c3 ltlt endl int
optimized_result analyze(values0, values1,
optimized_result) cout ltlt "Optimized result "
ltlt optimized_result ltlt endl return 0
16
X x1, x2, x3 Y y1, y2, y3 Z z1, z2,
z3 coefficients k1, k2, k3, a1 k1 x1
k2 x2 k3 x3 a2 k1 y1 k2 y2 k3
y3 a3 k1 z1 k2 z2 k3 z3 b1 a1
a2 b2 a2 a3 b3 a3 a1 c1 k3 b1 k1
b2 c2 k1 b2 k2 b3 c3 k2 b3 k3
b1 Conclusion (c1 c2 c3) / 3 d1
Conclusion (1 k1) d2 Conclusion (1
k2) d3 Conclusion (1 k3) e1 d1 d2 e2
d2 d3 e3 d3 d1 Final_Conclusion k1 e1
k2 e2 k3 e3
17
For triangle ??1? ??1??1??1??1 For triangle
??2? , which is formed from the smaller
ones ??2??1??2'(where ??2' is a sum from other 
adjacent triangles)
Logic of the Great, Logic of the Wise Fedorchenko
Mikhail Valerevich
18
Law A law is something that exists and happens
in an elementary, clear and obvious
way. ?x(P(x)?Q(x)) x is a variable that can be
an object or a phenomenon. P(x) is a condition
that is always met. Q(x is a consequence that
always occurs when the condition P(x) is met.
J is life (chariot), P(x) is passenger xxx, S is
fate (coachman), M is the route of life (fixed
path). Logical formula J rolls with constant
speed and fixed route M, where M determines the
path. S controls this route ?x(P(x)?S(M))), that
is, for each passenger, fate controls the
route. A passenger can leave the path, but not
change the route itself ?x(P(x)?S(M)), where
there is a passenger x who can leave the path,
but cannot change the route. Thus, the logical
formula expresses that fate determines the route
of life, and passengers can only choose whether
to stay on the path or leave it.
????? ????????, ?????????? ??????? ??????????
????? ? ??????? ?????????? ???????. To win, you
just need to make the right choice and take the
right decision. P?(V?R) P is the victory
condition (victory achieved), V is the correct
choice, R is the correct decision. The formula
says that to achieve P, it is necessary that V
(correct choice) and R (correct decision) are
simultaneously fulfilled.
Three principles for preventing the outbreak of a
world war. Mutual benefits from each other's
presence ?Conflict (Will not bring benefit A ??
Will bring unacceptable costs B?)?War End of
Exist ?Conflict ???O?
Without doing irreversible actions, you will
never get into a hopeless situation. ( A ) the
action is irreversible. ( B ) got into a
hopeless situation. A -gtB A -gt B
??? ???? ????? ????????? ?????? ?????, ??????
???? ????? ? ????? ????????? ?????? ?????, ?
?????? ?? ????? ? ?? ?????. All people can pass
through walls, it's just that some know and can
pass through walls, while others don't know and
can't. ?x(H(x) ? (P(x) ? (K(x) ? K(x))))
(R?C)?P R Cause of Exist, C Consequence of
Exist, P Continuation of Exist. O?A O?A O
the presence of an obstacle (Obstacle), A the
action to overcome (Action to overcome). If the
obstacle exists (O), action A must be
performed. R?F R Reasonable, F Follow. If
something is reasonable (R), it is necessary to
follow it (F). Rt??P Rt? action with a
result, P permissibility of the action. An
action is permissible (P) if it has a result
(Rt?).
P-gtQ ( P ) "there is a choice", ( Q ) "there
will be a disition", 195 n -gt limit.
21.01.2025 ?O?
19
P -gt a gt a-gtP, P ? a,b,c,d,e,f,g gt
(abcdefg)-P h gt P-gt -h a,b,c,d gt if ab
a!cd gt (ab) (cd) gt ab (cd) A1 gt
That A 1, That !A 0 If A1 gt proof -gtA-gt
proof If A-gtB-gtC ? That B -gtA, That C -gt A
If C-gtAB ? A-C -gtB, B-C -gtA A-B -gtC CB-gtA
CA-gtB If AP gt A ab-gtP If AP gt -P-A A
! B ! C gt AC A -gt ? gt A-gt a1,a2,a3
a1-gtb1,a2-gtb2, a3-gtb3 b1b2b3B gt A-gt
B a,b,c -gt ab-gt P bc-gtQ ac-gtR gt PltgtQ
ltgtR or (P-Q)-RP and Q P-Q-gt R PQ -gt S
gt R-S or RltgtS ????? ?? ??????? ????????? -
????????????. Living with a Sound Mind is a
pleasure. ???O?
Problem Task1 Task2 Tesk3 Simpletask11
Simpletask12 Simpletask13 Simpletask21
Simpletask 22 Simpletask 23Simpletask31
Simpletask32 Simpletask33 Subtask 11-12 Subtask
12-13 Subtask 21-22 Subtask 22-23 Subtask 31-32
Subtask 32-33 Solutio1 12 Solutio2 12
Solutio3 12 Solving 12 Solutio2 23 Disition
12
20
The one who is in a losing position must make
concessions to the one who is in a winning
position. The one who is in a winning position
can make concessions and accept the will of the
one who is in a losing position.P the subject
is in a losing positionW the subject is in a
winning positionC1? the subject in a losing
position makes concessionsC2? the subject in a
winning position makes concessions.The logical
statement can be expressed as followsP ?
C1?If the subject is in a losing position, then
it must make concessionsW ? C2?If the
subject is in a winning position, then it can
make concessions and accept the will of the other
subjectThe full formula combining both
statements(P ? C1)?(W ? C2)
Let A be a situation or obstacle that can be
bypassed.Let B be a situation or obstacle that
cannot be bypassed (that which must be
overcome).Then the logical formula will look
like this(A?C)?(A?B)HereA?C means that if
the obstacle can be bypassed, then it must be
done (where C is the action of bypassing).A?B
means that if the obstacle cannot be bypassed
(that is, A), then it must be overcome (where B
is the action of overcoming).Thus, the formula
says that in the case of a bypassable obstacle,
it must be bypassed, and in the case of an
insurmountable obstacle, it must be overcome.
21
K is quality.Q is quantity.P is the process of
transition.Then"Quality transforms into
quantity" can be written as K?Q."Quantity does
not transform into quality" can be written as
(Q?K), which is equivalent to Q?KThe full
formula is(K?Q)?(Q?K)This formula states
that quality always transforms into quantity, and
quantity is not capable of transforming into
quality on its own.
Basic elements P(x) action or substance that
supports the life of nature. B(x) action or
substance that benefits nature. S(x) nature
accepts (absorbs) xxx. M(x) action observes
measure. E nature exists forever. Formulation
Nature absorbs what supports its life and
benefits it ?x ((P(x)?B(x))?S(x)) Everything
that nature accepts, observes measure ?x(S(x)?M(
x)). Observance of measure and acceptance of
what is useful preserve nature ?x((S(x)?M(x))?E)
. Thus, nature is eternal if the above is
observed ?x((P(x)?B(x)?M(x))?E) These formulas
illustrate the relationship between utility,
measure and eternity of nature.
What you give is what you get from others. ?x
(A(x) ? R(x)) Where x is a person or
object. A(x) is the action that x performs. R(x)
is the response that x receives. ? denotes
interdependence (if and only if).
22
The idea of ??replacing God with AI is
problematic because the lack of connection with
God will cause mental and psychological disorders
and lead to the general degeneration of the
population.Let's work through this in more
detail, step by step, to connect theoretical
statements with logic and mental aspects.1. The
role of connection with God for the
psycheConnection with God (or higher meaning)
performs functions that are recognized as
important for psychological healthExistential
support the idea of ??God gives a person a
meaning in life, helps to cope with the awareness
of mortality.Social connection religious
systems unite people, providing a sense of
belonging.Moral guidelines religion often forms
norms of behavior and values, which stabilizes
society.Emotional support faith in God helps
people cope with crises and remain
optimistic.Without this, the psyche becomes more
vulnerable to stress, depression and existential
crises.FormalizationIf S is a connection with
God, and F(S) is stabilization of the psyche,
thenS?F(S)?R?SWhere R?R is a high level of
mental health.2. AI as a substitute for GodAI
offers a rational, technocratic replacement for
God. But it cannot fully perform all
functionsLack of existential depth AI is not
able to give a higher meaning, but offers only
utilitarian solutions.Alienation interaction
with AI does not create the same emotional
connections as with a religious community.Moral
uncertainty AI makes decisions based on data,
which does not always coincide with human moral
values.FormalizationIf AI is a replacement
for God through AI, and F(AI) is its function,
thenF(AI)ltF(S)(AI functions are less effective
for stabilizing the psyche).3. Consequences of
the lack of connection with GodThe absence of
God (S) and its replacement with AI (AI) creates
a "void"People lose their existential support,
which increases the risk of depression and
anxiety disorders.Weakening social cohesion
leads to increased isolation, which exacerbates
mental health problems.Loss of moral guidelines
leads to increased conflicts and
aggression.FormalizationS?AI?R?Where R? is
a decrease in mental health.4. Population
degradationMental health directly affects the
development of societyMental disorders reduce
productivity and birth rate.The growth of
individualism and isolation reduces social
cohesion.Deterioration of morale leads to the
destruction of culture.This creates a vicious
circleR??D?Where D? is the degradation of
society.Final chainLet's combine everything
into a single statementS?AI?R??D?Explanation
If you remove the connection with God (S) and
replace it with AI (AI), this will lead to a
decrease in the level of mental health (R?),
which over time will cause the degradation of the
population (D?).If you need to add specific
studies or examples, we can strengthen the
justification. For example, provide data on the
influence of religiosity on mental health or the
consequences of social isolation.
23
From 12 incorrect answers, you need to get one
correct answer, find the least erroneous answer
and solve the problem of getting the correct
answer from it. Find the least erroneous answer,
the largest number of arguments for this
answer A least erroneous argmin?i?1,2,,12E(
Ai) Correct it and get the correct
answer Acorrect C(Aleast erroneous) Where E(
A) is the error function, which estimates how
many contradictory elements there are in the
answer. C(A) is the correction function, which
corrects contradictions (errors) in the
answer. Thus, the final correct answer Acorrect
is obtained by minimizing errors and correcting
them.
A logical formula where the argument is taken
into account only if it is greater than
zero Accepted ? xgt0 Or in a more formalized
form F(x)True,if xgt0,False,if x0. Where x
is the argument, and F(x) returns true if the
argument satisfies the condition.
If a statement or conclusion causes a problem,
write a logical formula algorithm to solve this
problem. P is a statement or conclusion. Problem(
P) is a function that determines whether there is
a problem in P. TypeAnalyze(P) is a function
that determines the type of problem. Fix(P,Type)
is a function that corrects the problem of type
Type in P. PcorrectP? is the corrected
statement. Correction formula PcorrectFix(P,A
nalyze(P),if P Problem(P)True, Problem(P)False.
Explanation If the problem exists
Problem(P)True, the following is performed
Analysis of the problem type TypeAnalyze(P). Corr
ection of the statement taking into account the
problem type Fix(P,Type). If the problem is
absent Problem(P)False, the statement P remains
unchanged.
24
S is the current state.Win(S) is a check whether
the state S leads to victory True if you
win.Lose(S) is a check whether the state S leads
to defeat True if you lose.Analyze(S) is a
function of analyzing the current state, which
determines weaknesses and strengths.ChangeStrateg
y(S) is a function of changing tactics for weak
areas.Snew is a new state after adjusting
tactics.Simplified formulaSnewS, if
Win(S)True, ChangeStrategy(Sweak)Sstrong, if
Lose(S)TrueThe meaning of the formulaWhere
you win Sstrong, the tactics remain
unchanged.Where you lose Sweak, the tactics
change.The process continues until you reach a
winning state.
Logical formula for choosing the right
direction Notation Pp1,p2,,pn set of
possible paths. S(p) state that occurs when
path p is chosen. Goal(S(p)) function that
checks whether path p leads to the goal True, if
the path leads to the goal. Utility(S(p))
utility score of the state that occurs when path
p is chosen. pbest chosen correct
path. pbest?argmax v p?Pvalid ??Utility(S(p)),
if Pvalid??!Ø, argmax v p?P?Utility(S(p)),? if
Pvalid?Ø.? Only paths that lead to the goal
(Pvalid?) are selected. Among these paths, the
one that brings maximum utility (Utility) is
selected. If there are no paths to the goal, the
most useful path of all is chosen.
A logical formula of thinking, a conclusion that
determines truth and falsity. T(p) A function
that returns True if p is proven, False if p
is proven, and Unknown if neither p nor p can
be proven. T(p) True if D(p(Proposition)-
E(Empirical experience), A(Models of Cognition,
Experience of Comprehension, !!! Those who do not
know and comprehend have no experience /Axioms,
Dogmas and what we accept as truth, without
proof, Culture/Theory), R(Rules and laws of logic
and inference. Validation )) outputs p False if
D(p, E, A, R) outputs p Unknown if D(p, E, A, R)
outputs neither p nor p
25
All processes are Interdependent - the result is
the Interdependence of all processes.

Logical formula for your statement
?P(x) ? ? P(x) ? ?P, where

? - universal quantifier (for ALL processes)
P(x) - individual process
? - set of all processes
? - logical equivalence sign
?P - integral sum of all interconnected processes
Expanded interpretation

Each process is part of the overall system
It is impossible to consider a process in
isolation
The result is holistic interdependence
A change in one process affects all the others
The structure shows the total interconnection and
interdependence of all processes in the universal
system.

????? ?????????? ???????, ??????????????
????????????? ????????????, ???????? ???????.
Resource consumption is limited in accordance
with the rate of restoration and renewal. Logical
formula.( R_p ) resource consumption rate
(units per year).( R_r ) resource restoration
rate (units per year).( C ) coefficient that
shows if resource consumption is greater than its
restoration, then the resource stock is
exhausted.Then, logically, resource consumption
is limited by its restoration ifRpRr?This
means that the resource consumption rate must be
less than or equal to its restoration rate for
the resource to remain in a stable balance. If (
R_p gt R_r ), then the resource is exhausted,
which can lead to its deficit.For more accurate
modeling, you can introduce variables that will
take into account the remaining stock of the
resource, for exampleRptRrtRresidualRp?tRr
?tRresidualwhere( t ) the time for which
consumption occurs( Rresidual ) the initial
stock of the resource.This formula says that the
total consumption of the resource over a certain
period of time should not exceed its restoration
plus the initial stock.
26
The logical formula for expressing the statement
"If you can't do it, then you're doing it wrong"
can be written as followsLet's say( P )
you're doing something right.( Q ) you're
doing it.P -gt QThen the statement "If you
can't do it, then you're doing it wrong" can be
written asQ -gt PHere( Q ) you're not
doing it (failure).( P ) you're doing
something wrong.This means that if you can't do
it (failure), then you're doing something wrong.
To overcome an obstacle, you need to find an
alternative path to the same place, without
obstacles. ( P ) an obstacle on the way. ( A )
an alternative path has been found. ( D )
reaching the goal (getting there). ( N ) a path
without obstacles. P -gt (D ? A ? N) -gt P
????? ?????????? ?????????? ??????????????, ????
? ??? ?????? ??? ??????, ?? ?? ????? ????? ?????,
? ??? ????????, ?? ????????? ??????. Putin is
exterminating Russian intellectuals, seeing them
as a threat to power, and does not see Elon Musk
and his ilk outside of Russia. (P?T)?M?R P
Putin is exterminating Russian intellectuals. T
Russian intellectuals are a threat to the
government. M Putin sees Elon Musk and his
ilk. R Elon Musk and his ilk are outside of
Russia.
Nuclear weapons power can be overcome by
peace N Nuclear weapons power. P Overcoming
(or possibility of overcoming) nuclear weapons
power. M Peace (as a state of peace, absence of
war and conflicts). N ? P?M
27
"That which has no Mind cannot Exist" can be
translated as "If X has no Mind, then X does not
exist" Using logical notations Let R(x) mean "x
has Mind" Let E(x) mean "x exists" Then the
logical formula will look like this ?x(R(x) ?
E(x)) This formula can also be read as "For
any x if x does not have Mind, then x does not
exist"
????? ???????? ???????? ???????? ???????? ???????
???????. Any action triggers the feedback
processes of the System. ???O? "Any action
causes the processes of the System's reverse
reaction" can be formalized as follows Let's
introduce the notation Let A(x) mean "x is an
action" Let R(x,y) mean "y is the reaction of the
system to x" Let S mean "System" Then the logical
formula will be ?x(A(x) ? ?y(R(x,y) ?
y?S)) This formula can be read as "For any x
if x is an action, then there exists y such that
y is the reaction of the system to x and y
belongs to the System" Or, more simply, "For
every action, there is a corresponding reaction
that belongs to the System"
28
Heten (Planet Earth) is a subsystem of the Solar
system. Being a Single Whole system, on which
everything that is on it depends, being its
subsystems. Any change in the Single Whole
system, Heten, is directly reflected in all
subsystems. This system is owned by the Lord
God. H - Heten (Planet Earth) S - Solar System G
- Lord God Sub(x,y) - "x is a subsystem of
y" Own(x,y) - "x owns y" C(x) - "x is a Single
Whole System" D(x,y) - "y depends on x" Ch(x) -
"change in x" A(x,y) - "x is reflected in y" Full
logical formula Sub(H,S) ? C(H) ?
?x(Sub(x,H) ? D(H,x)) ? ?x?y((Ch(H) ?
Sub(y,H)) ? A(x,y)) ? Own(G,H) This formula can
be read as "Heten is a subsystem of the Solar
System and is a Single Whole System, And for all
x if x is a subsystem of Heten, then x depends
on Heten, And for all x,y if a change occurs in
Heten and y is a subsystem of Heten, then this
change is reflected in y, And the Lord God owns
Heten"
graph TD Definition of the main
elements GodLord God SSSolar
System HHeten/Planet Earth subgraph Heten
Subsystems BBiosphere AAtmosphere H2OHydrosph
ere LLithosphere end Ownership and
Hierarchy Relations God --gtOwns H SS
--gtIncludes H Subsystem Dependencies H
--gtAffects B H --gtAffects A H --gtAffects
H2O H --gtAffects L Note on a Single
System noteHeten is a Single Whole
System,ltbrgtall changes in whichltbrgtare reflected
in the subsystems H -.-gtNote note
29
Everything has a limit (limit). L(x,y) means "y
is a limit of x" E(x) means "x exists" The
logical formula will be ?x(E(x) ?
?y(L(x,y))) Where ?x is a universal quantifier
("for all x") ?y is an existential quantifier ("y
exists") ? - implication ("if..., then...") This
formula can be read as "For any x if x exists,
then there is y such that y is a limit of x" Or
more simply "For everything that exists, there
is a limit" You can also add the clarification
that the limit is unique for each
object ?x(E(x) ? ?!y(L(x,y))) Where ?! -
existential and unique quantifier ("there is only
one") This is read as "For any x if x exists,
then there is a unique y such that y is a limit
of x"
Balance and Equilibrium in the Earth System
(Heten) and its subsystems The only condition for
the Presence of Life on the Planet, Harmony gives
the production of Life. Describe with a logical
formula. To describe the concept of "Balance and
Equilibrium" as conditions for the existence of
life on Earth, as well as the relationship
between harmony and the production of life, the
following representation can be used. Balance
and Equilibrium as a condition for the presence
of life This can be expressed as the need for
certain conditions to support life, that is,
maintaining stability in ecological, climatic and
biological systems. Formally (B) The state of
the Earth system is maintained if ?Si 0 (B)
The state of the Earth system is maintained if
?Si? 0 where ( S_i ) are changes (influences)
of various subsystems of the Earth (atmosphere,
biosphere, hydrosphere, etc.), and if the sum of
these changes is zero, then the system is in
equilibrium, which allows life to exist. Harmony
as a condition for the production of life In
order for life to develop, it is necessary that
these elements are not only in balance, but also
interact in such a way as to support life
processes. Harmony presupposes active cooperation
of all subsystems in maintaining life cycles,
energy and matter exchange. This can be
expressed as follows (H)Harmony of
systems??EiProduction of life ( H)Harmony of
systems??Ei?Production of lifewhere ( E_i ) are
the flows of energy and matter between subsystems
that create conditions for the emergence and
maintenance of life. Thus, the viability and
development of life can be described as (G)
-gt(B)?(H)?Life on Earth exists and develops (B)
- balance and equilibrium in the Earth
system. (H) - harmony between subsystems that
supports life. Here "G" is life, which is
possible only in conditions of both balance and
equilibrium, and harmony in the planet's
systems. This approach combines two key elements
stabilization of conditions for existence and
active maintenance of processes necessary for the
production of life.
You must understand In your case, there can be
no talk of a century. ?- ? Earth System
0.
30
It is easy to go from mud to the Palace, but it
is impossible to return from the Palace to
mud. Mud ? Palace (you can get from mud to the
palace) (Palace ? Mud) (you cannot return from
the palace to mud) Irreversibility of Life
processes. Each new step becomes easier.
?? ?????? ?????? ? ????? ??????? ?? ? ?????
???????? ???? ? ?? ????? ????. You must
understand In your case, there can be no talk of
a century. ?- ? Earth System 0.
The logical formula for this can be expressed as
follows B?Z (Inaction leads to the
encouragement of Evil.) Bf(ChB) (Inaction is a
function of the Feeling of Powerlessness.) Ug(T)
(Success is a function of Creation.) U?S (Success
awakens the Power to act.) Combining
everything f(ChB)?Z,g(T)?U?S. Or in a short
interpretation (ChB?B?Z)?(T?U?S)
Formula for the system state S1, if PU
(balance). S0, if P?U (imbalance). Let's add
superposition as an intermediate
state Superposition (Scp) is the moment of
system transition, where the balance is
temporarily not defined or at the same time there
is a potential for equilibration. General
formula S1,if PU, cp, if PU (within the
permissible error), 0,if P?U. Confirmation of the
conclusion S1 Full balance (as much as
decreased, so much as arrived). Scp The system
is in a state of dynamic transition, where
balance is approaching, but has not yet been
reached. S0 Imbalance (the principle "as much
as decreased, so much as arrived" is
violated). Short version of the
formula S1cp0 where superposition (cp) is an
intermediate state between 0 and 1.
31
The universal logical formula of justice can be
formulated as followsF(S, B, I, C) (S ? B ?
I) ? V(D) V(P)ExplanationS (Symmetry)
actions and their consequences apply equally to
all parties under the same conditions.B
(Balance) equilibrium between rights, duties,
and results.I (Identity) the situation and
actions must be identical in relation to moral
and logical standards.C (Consequences) the
value of an action is equal to the value of its
consequences.V(D) The meaning/value of an
action.V(P) The meaning/value of the
consequences of an action.The formula is read
asJustice is achieved if and only if symmetry,
balance, and identity are fulfilled, and the
meaning of an action is equal to the meaning of
its consequences.Example of usageIf a person
has committed a certain action (D), then the
consequences (P) must be equivalent in terms of
scale and significance for all participants.
The formulation emphasizes that power (W) arises
from recognition (A) and is based on the ability
to solve problems (R) and ensure existence (S),
in the presence of resources (Rm). Logically,
this looks correct W A ? ((R ? S) ?
Rm) Let's decipher A ? ... power is possible
only if it is recognized by people. Recognition
is a condition. (R ? S) a combination of the
ability to solve problems and ensure continued
existence. These are the main functions of
power. Rm the resources necessary to perform
these functions. This formula shows that
recognition of power by society is a
prerequisite, but its stability depends on the
ability to effectively perform its functions.
32
The logical formula for expressing the statement
"As long as people fight for Life, Life will
continue" can be written as followsFormulaB
? LWhereB is people's struggle for life
(Effort or struggle for life).L is the
continuation of life (Continuation of
life).Expanded structure of relationshipsCondit
ion The struggle for life (B) is a necessary
condition for the continuation of life
(L).Cause-and-effect relationship If the
struggle (B) ceases, then life (L)
ceases.FormallyB ? LNecessity of struggle
Life does not continue by itself, it depends on
activity and effort.Integration into the dynamic
modelIf we consider struggle and life as a
processB(t) is the struggle for life at time
t.L(t1) is the continuation of life at the next
time.ThenB(t) ? L(t1)This expresses the idea
that the current effort (B) becomes the basis for
future existence (L).
The statement "The solution to the problem is in
its condition" can be expressed by a logical
formula as follows Formula C ? S Where C is
the condition of the