Peter Amstutz is a user on octodon.social. You can follow them or interact with them if you have an account anywhere in the fediverse.
If you don't, you can sign up here.
A question that troubles me:
Is there any obvious way to unambiguously record the following three values in a binary relation (ie, a two-column table)?
1. A
2. (A . nil)
3. (A . B)
for any sensible A and B (ie, finite values, but including both atoms and finite structures, ie sets/pairs/tables).
The naive idea, and the one that I think Dave Childs proposed in Extended Set Theory, is to record 'A' as (A . nil)
But as you can see, that doesn't work, because 2.
@natecull If you have separate symbols/concepts for "false", "unknown", "zero", "doesn't exist" and "end of list" instead of overloading the concept of "nil" then I think you can make it work.
