The NOT operator strikes

!
Do ! go there or !here unless !. Its everywhere.
In G, I think, every operator, the first byte of link, will have an inverse. The thing Does this or NotDoes this. There is a default for both, dunno how the default works yet.

! binds tightly to the adjacent triple. I say we allocate the left bit of our allocated byte and call that the not modifier, every 7 bit op has the not modifier on or off. Bind the not to the hing on its right, in TE generally, it can be bound to a SET or a DESCENT:
No!(a,b,c,!d.g!h,!l) call this valid syntax, the unassigned not, g!h defaults to the descent dot, !.. Descent is generally the default operator, though saying that I likely contradicted my self many times.

So if we look at the machine's byte space of the first 128 characters, about 16 will be internal. The standard TE character set should be reserved, and use that basic set across the board. So at least 100 specialized opcodes remain available for specialized SQL selects. And three bytes of the link value can direct a call back to RDF on match, and the called back overlay can expand and be re-written into the result table, in nested order. That it the point the machine should kick out to the rdf standard

So truthiness, it is all in the match routine.

Everything else is just a pinball architecture. Seriously. The staff at Imagisoft met and spent an hour considering the construction of a knowledge machine, out of old pinball machines, relays, steel balls, little gadgets that catch and spin a truthiness thingie. The client drops a stack of pinball into the query tube. One pops out, and the one behind goes to ready state. The first drops, and is trapped as it needs a match to pass, it triggers the release of the database tube of steels balls, and one drops out. Together the two bounce around discovering truthi things, and on dropping out leave the ready relay in the right state. You know, real computer stuff, not this penny ante c language.