- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Computable de Finetti measures
Annals of Pure and Applied Logic 163 (5):530-546 (2012)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Randomness for computable measures and initial segment complexity.Rupert Hölzl & Christopher P. Porter - 2017 - Annals of Pure and Applied Logic 168 (4):860-886.
A-computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2016 - Annals of Pure and Applied Logic 167 (3):235-246.
Pairs of computable structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
Computable Stone spaces.Nikolay Bazhenov, Matthew Harrison-Trainor & Alexander Melnikov - 2023 - Annals of Pure and Applied Logic 174 (9):103304.
Finite computable dimension and degrees of categoricity.Barbara F. Csima & Jonathan Stephenson - 2019 - Annals of Pure and Applied Logic 170 (1):58-94.
Computable neighbourhoods of points in semicomputable manifolds.Zvonko Iljazović & Lucija Validžić - 2017 - Annals of Pure and Applied Logic 168 (4):840-859.
On subrecursive complexity of integration.Ivan Georgiev - 2020 - Annals of Pure and Applied Logic 171 (4):102777.
Computable fields and the bounded Turing reduction.Rebecca M. Steiner - 2012 - Annals of Pure and Applied Logic 163 (6):730-742.
Bezem, M., see Barendsen, E.G. M. Bierman, M. DZamonja, S. Shelah, S. Feferman, G. Jiiger, M. A. Jahn, S. Lempp, Sui Yuefei, S. D. Leonhardi & D. Macpherson - 1996 - Annals of Pure and Applied Logic 79 (1):317.
Computable irrational numbers with representations of surprising complexity.Ivan Georgiev, Lars Kristiansen & Frank Stephan - 2021 - Annals of Pure and Applied Logic 172 (2):102893.
Analytics
Added to PP
2013-10-27
Downloads
49 (#449,045)
6 months
20 (#147,431)
2013-10-27
Downloads
49 (#449,045)
6 months
20 (#147,431)
Historical graph of downloads
Citations of this work
Computable randomness and betting for computable probability spaces.Jason Rute - 2016 - Mathematical Logic Quarterly 62 (4-5):335-366.
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
La Prévision: Ses Lois Logiques, Ses Sources Subjectives.Bruno de Finetti - 1937 - Annales de l'Institut Henri Poincaré 7 (1):1-68.
Domains for computation in mathematics, physics and exact real arithmetic.Abbas Edalat - 1997 - Bulletin of Symbolic Logic 3 (4):401-452.
Computable metrization.Tanja Grubba, Matthias Schröder & Klaus Weihrauch - 2007 - Mathematical Logic Quarterly 53 (4‐5):381-395.
Admissible representations for probability measures.Matthias Schröder - 2007 - Mathematical Logic Quarterly 53 (4):431-445.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-lxkd2 dc2