Since one of my dead horses is artificial discretization, I've always wondered
what it's like to work in many-valued logics. So, proof by contradiction would
change from [not-true => false] to [not-0 => {1,2,..,n}], assuming a
discretized set of values {0..n}. But is there a continuous "many valued"
logic, where any proposition can be evaluated to take on some sub-region of a
continuous set? So, proof by contradiction would become something like
[not∈{-∞,0} => ∈{0+ε,∞}]?
On 1/2/19 11:23 AM, Frank Wimberly wrote:
> p.s. Dropping the law of the excluded middle required giving up proof by
> contradiction.
--
☣ uǝlƃ
============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
to unsubscribe http://redfish.com/mailman/listinfo/friam_redfish.com
archives back to 2003: http://friam.471366.n2.nabble.com/
FRIAM-COMIC http://friam-comic.blogspot.com/ by Dr. Strangelove
