P(‘¬F’) ≥ a. Since probabilities sum to one, the system can prove that P(‘F’) < 1-a.
You mean, because we can always replace the first “a” with some b>a?
This seems like a very cool—and bizarre—result.
Sorry, a bit sloppy with the > and ≥ - since you can always choose a slightly larger “a”, it still works out. I’ve corrected the text.
You mean, because we can always replace the first “a” with some b>a?
This seems like a very cool—and bizarre—result.
Sorry, a bit sloppy with the > and ≥ - since you can always choose a slightly larger “a”, it still works out. I’ve corrected the text.