⌬Logecs
Logic that refuses the binary. The ponegator, the four symbols, the tautologies that survive contradiction — an emulator you can turn by hand.
The ponegator is the operator binary logic has no room for: it neither affirms nor denies, it turns the claim by a quarter. Four turns return you to where you began — which is why contradiction here is a rotation, not a collapse.
Binary thinking manufactures enemies: it forces every unique thing into a comparison it must lose. Logecs adds two positions between yes and no — the open and the extended — so that a claim can be incomplete without being false.
A tautology in Logecs is not a statement that cannot fail; it is a statement that returns to itself after four rotations. That is the whole discipline of Logex: to write expressions whose rotations you can predict.
Logecs is written to be taught to an AI. The repositories in this realm move from plain lessons through parsers and axiomators to hooks — the points where a learner attaches itself to the system and begins to terraform.
The emulator above is deliberately small. Its plates are the same plates the parser implements; if you can turn them by hand, you can read the code.
Sources in this realm
78 repositories of source, documents and AI training material.
How Spireason is supported by Logecs: logic, tautology, logex.
Can Logecs and Logex be programmed? First insight.
General introduction to the math and theory.
Parser development environment.
Deep learning introduction, Laegna-flavoured.
Fourth course in the Laegna AI lessons.
Where users hook themselves to an AI, and terraform.