Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T00:54:27.246Z Has data issue: false hasContentIssue false

On Characterizing Unary Probability Functions and Truth-Value Functions

Published online by Cambridge University Press:  01 January 2020

Hugues Leblanc*
Affiliation:
Temple University, Philadelphia PA 19122, U.S.A.

Extract

Consider a language SL having as its primitive signs one or more atomic statements, the two connectives ‘∼’ and ‘&,’ and the two parentheses ‘(’ and ‘)’; and presume the extra connectives ‘V’ and ‘≡’ defined in the customary manner. With the statements of SLsubstituting for sets, and the three connectives ‘∼,’ ‘&,’and ‘V’ substituting for the complementation, intersection, and union signs, the constraints that Kolmogorov places in [1] on (unary) probability functions come to read:

K1. 0 ≤ P(A),

K2. P(∼(A & ∼A)) = 1,

K3. If ⊦ ∼(A & B), then P(A ∨ B) = P(A) + P(B),

K4. If ⊦ A ≡ B, then P(A) = P(B).2

Information

Type
Research Article
Copyright
Copyright © The Authors 1985

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable