On 6/6/2020 3:47 AM, Bruno Marchal wrote:
The axioms that I use are just Kxy = x, and Sxyz = xz(yz).
But you allow rules of inference that permit inferences about the enumerated
array of all functions.
Right. Here is the complete set of ontological assumptions:
AXIOMS
KAB = A
SABC = AC(BC)
RULES:
If A = B and A = C, then B = C
If A = B then AC = BC
If A = B then CA = CB
Those are not the rules you have used to infer incompleteness.
Incompleteness and provabilty aren't even expressible within that ontology.
Brent
--
You received this message because you are subscribed to the Google Groups
"Everything List" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/everything-list/d72a9d5b-12cc-a8cc-555c-0763b21fd392%40verizon.net.
