Hi, All:(adsbygoogle = window.adsbygoogle || []).push({});

Just curious as to whether there is some sort of canonical extension of the standard

binary connectives: and, or, if, iff, etc. , to n-valued logic. I imagine this may have to see

with Lattices, maybe Heyting Algebras, and Order theory in general. Just wondering if

someone knows of somewhere where this has been worked out.( As more of a speculation,

I wonder if there would be

a way of considering probability theory as n-valued logic when n-->oo , tho I am pretty

sure I am being sloppy.)

Thanks.

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Extension of Binary Connectives to n-valued Logic?

Loading...

Similar Threads - Extension Binary Connectives | Date |
---|---|

I Extension of Turing computable | Nov 14, 2017 |

B Not sure what this problem would be called... | Apr 4, 2017 |

Mathematics to be simply an extension of logic | Jun 2, 2013 |

Axiom of extension | May 4, 2012 |

Transfinite Theory as an Extension of the Natural Numbers | Feb 26, 2012 |

**Physics Forums - The Fusion of Science and Community**