Weird idea:
What if the 'truth value' of a logical statement were a list of the axioms assumed to be true in order to prove it?
Is... is that just what the Church-Turing Wassname is?
@lizardsquid The thing that's different is that Prolog doesn't work by rewriting terms and you can't just create a value called ':- A,B,C' and put it anywhere and because :- is just infix form for :- (X, (A,B,C))
but what if you could
would it be insane or
@lizardsquid It's also somewhat similar to how a Prolog predicate is defined.
'X :- A,B,C' is sorta-kinda like
'X = A,B,C'
(if we assume A,B,C is the only definition for X)