Skip to main content

New aspects of the probabilistic evaluation of hypotheses and experience

Buy Article:

$47.50 plus tax (Refund Policy)

The probabilistic corroboration of two or more hypotheses or series of observations may be performed additively or multiplicatively . For additive corroboration (e.g. by Laplace's rule of succession), stochastic independence is needed. Inferences, based on overwhelming numbers of observations without unexplained counterinstances permit hyperinduction , whereby extremely high probabilities, bordering on certainty for all practical purposes may be achieved. For multiplicative corroboration, the error probabilities (1 - Pr) of two (or more) hypotheses are multiplied. The probabilities, obtained by reconverting the product, are valid for both of the hypotheses and indicate the gain by corroboration.. This method is mathematically correct, no probabilities > 1 can result (as in some conventional methods) and high probabilities with fewer observations may be obtained, however, semantical independence is a prerequisite. The combined method consists of (1) the additive computation of the error probabilities (1 - Pr) of two or more single hypotheses, whereby arbitrariness is avoided or at least reduced and (2) the multiplicative procedure . The high reliability of Empirical Counterfactual Statements is explained by the possibility of multiplicative corroboration of “all-no” statements due to their strict semantical independence.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Document Type: Research Article

Affiliations: Kirchengasse 28, A-1070 Vienna, Austria

Publication date: 01 July 2000

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more