Various controversies surrounding the meaning of conditionals like "A given B" or "if B then A" are discussed including that they can non-trivially carry the standard conditional probability, are truth functional but have three rather than two truth values, are logically and probabilistically non-monotonic, and can be combined with operations that extend the standard Boolean operations. A new theory of deduction with uncertain conditionals extends the familiar equations that define deduction between Boolean propositions. Several different deductive relations arise leading to different sets of implications. New methods to determine these implications for one or more conditionals are described. An absent-minded coffee drinker example containing two subjunctive (counter-factual) conditionals is solved. The use of information entropy to cut through complexity, and the question of the confidence to be attached to a maximum entropy probability distribution, are discussed including the results of E. Jaynes concerning the concentration of distributions at maximum entropy.
展开▼
机译:转换术语± Sup> [n i Sub>] f(+/-) min sup>的条件最小化结构的逻辑动态过程的方法Sub> AND ± Sup> [m i Sub>] f(+/-) min Sub>在功能添加结构中± Sup> f < Sub> 1 Sub>(Σ RU Sub>) min Sub>,不带纹波f 1 Sub>(± Sup>←←)和循环ΔtΣ Sub>→5∙f(&)-和5个条件逻辑函数f(&)-,并通过三元数系统的算术公理同时转换术语参数的过程f RU Sub>(+ 1,0,-1)及其实现其的功能结构(俄罗斯逻辑版本)