Extension of Binary Connectives to n-valued Logic?

Bacle2
Science Advisor
Messages
1,089
Reaction score
10
Hi, All:

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 news on Phys.org
There is no "canonical" extension, but there are plenty of many-valued logics. I suggest having a look at the SEP entry for many-valued logic.
 
hanks, Preno.
 
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Back
Top