Hostname: page-component-7b7567c8c-jswmv Total loading time: 0 Render date: 2026-11-15T09:43:30.400Z Has data issue: false hasContentIssue false

Probability Functions: The Matter of Their Recursive Definability

Published online by Cambridge University Press:  01 April 2022

Hugues Leblanc
Affiliation:
Department of Philosophy, Temple University
Peter Roeper
Affiliation:
Department of Philosophy, The Australian National University

Abstract

This paper studies the extent to which probability functions are recursively definable. It proves, in particular, that the (absolute) probability of a statement A is recursively definable from a certain point on, to wit: from the (absolute) probabilities of certain atomic components and conjunctions of atomic components of A on, but to no further extent. And it proves that, generally, the probability of a statement A relative to a statement B is recursively definable from a certain point on, to wit: from the probabilities relative to that very B of certain atomic components and conjunctions of atomic components of A, but again to no further extent. These and other results are extended to the less studied case where A and B are compounded from atomic statements by means of “∀” as well as “~” and “&”. The absolute probability functions considered are those of Kolmogorov and Carnap, and the relative ones are those of Kolmogorov, Carnap, Rényi, and Popper.

Information

Type
Research Article
Copyright
Copyright © 1992 by the Philosophy of Science Association

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