Admissible representations for probability measures

Mathematical Logic Quarterly 53 (4):431-445 (2007)
  Copy   BIBTEX

Abstract

In a recent paper, probabilistic processes are used to generate Borel probability measures on topological spaces X that are equipped with a representation in the sense of type-2 theory of effectivity. This gives rise to a natural representation of the set of Borel probability measures on X. We compare this representation to a canonically constructed representation which encodes a Borel probability measure as a lower semicontinuous function from the open sets to the unit interval. We show that this canonical representation is admissible with respect to the weak topology on Borel probability measures. Moreover, we prove that for countably-based topological spaces the representation via probabilistic processes is equivalent to the canonical representation and thus admissible with respect to the weak topology

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Effectivity in Spaces with Admissible Multirepresentations.Matthias Schröder - 2002 - Mathematical Logic Quarterly 48 (S1):78-90.
Probability logic of finitely additive beliefs.Chunlai Zhou - 2010 - Journal of Logic, Language and Information 19 (3):247-282.
Spaces allowing Type‐2 Complexity Theory revisited.Matthias Schröder - 2004 - Mathematical Logic Quarterly 50 (4-5):443-459.
Quasi-Polish spaces.Matthew de Brecht - 2013 - Annals of Pure and Applied Logic 164 (3):356-381.
Interpretation of De Finetti coherence criterion in Łukasiewicz logic.Daniele Mundici - 2010 - Annals of Pure and Applied Logic 161 (2):235-245.
Better Foundations for Subjective Probability.Sven Neth - forthcoming - Australasian Journal of Philosophy.

Analytics

Added to PP
2013-12-01

Downloads
29 (#568,790)

6 months
5 (#711,233)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computable randomness and betting for computable probability spaces.Jason Rute - 2016 - Mathematical Logic Quarterly 62 (4-5):335-366.
Algorithmic randomness over general spaces.Kenshi Miyabe - 2014 - Mathematical Logic Quarterly 60 (3):184-204.
Computable de Finetti measures.Cameron E. Freer & Daniel M. Roy - 2012 - Annals of Pure and Applied Logic 163 (5):530-546.

Add more citations

References found in this work

No references found.

Add more references