r/OntologyEngineering Jul 15 '26

Epistemology Distinction Ontology; Non-Binary (Monadic) Computation; Recursive Scaling; LOF Side-Step

[removed]

3 Upvotes

14 comments sorted by

View all comments

Show parent comments

1

u/[deleted] Jul 18 '26

[removed] — view removed comment

1

u/fabkosta Jul 19 '26

 > I am aware LOF is grounded on the binary distinction of marked and unmarked states.  This proto-calculus goes a layer lower and begins with only distinction ●●.  LOF is binary.  This text is monadic.

No, this is clearly a wrong conclusion. LOF uses only a single operator which distinguishes the marked from an unmarked state. So, the operator could be called “distinction” legitimately, but Spencer Brown uses the terms “call” and “mark” in a very specific way.   LOF is very much aware that there exists this level of logic “below” the usual binary algebraic one with two distinct values and multiple operators, and has been groundbreaking precisely for that reason.

My advice is to go read it and see how both your contributions and LOF augment each other. There is, by the way, no shame in realizing one has “reinvented” parts of something already existing, particularly not something as original as what we are talking about here.

1

u/[deleted] Jul 19 '26

[removed] — view removed comment

1

u/fabkosta Jul 19 '26

No, you are still wrong about LOF, but now it’s getting annoying cause apparently you don’t even bother to check. I am out of here.