Sugihara monoids, RM3, infinite valued logic, and probability ...
Infinite-Valued Relevance Logic as a Probability Structure
Here’s a conceptual leap: if truth values form a bounded poset (e.g. real unit interval [0,1]), and conjunction, disjunction, and implication are operations preserving some form of ordering or residuation, you can begin to think of logic as probabilistic entailment.
Now, if we make the truth values correspond to probabilities (or credences), then:
A⇒B is strongest when the truth value of A is less than or equal to that of B.
This mimics conditional probability: P(B∣A) is highest when A almost implies B.
In fact, some researchers have developed algebraic models of conditional probability using residuated lattices or MV-algebras (multi-valued algebras from Łukasiewicz logic), and relevance logic’s demand for resource sensitivity fits naturally with context-sensitive probability assignments.
You can think of A⇒B not as a function of static truth values, but as "the degree to which A supports B," akin to Bayesian support.
#probability #rm3 #RelevanceLogic #ChatGPT