Logic and probabilistic systems

Archive for Mathematical Logic 35 (4):225-261 (1996)
  Copy   BIBTEX

Abstract

Following some ideas of Roberto Magari, we propose trial and error probabilistic functions, i.e. probability measures on the sentences of arithmetic that evolve in time by trial and error. The set ℐ of the sentences that get limit probability 1 is a Π3—theory, in fact ℐ can be a Π3—complete set. We prove incompleteness results for this setting, by showing for instance that for every k > 0 there are true Π3—sentences that get limit probability less than 1/2k. No set ℐ as above can contain the set of all true Π3—sentences, although we exhibit some ℐ containing all the true Σ2—sentences. We also consider an approach based on the notions of inner probability and outer probability, and we compare this approach with the one based on trial and error probabilistic functions. Although the two approaches are shown to be different, we single out an important case in which they are equivalent

Links

PhilArchive



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

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

Analytics

Added to PP
2013-11-23

Downloads
22 (#733,560)

6 months
5 (#710,311)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Probabilities over rich languages, testing and randomness.Haim Gaifman & Marc Snir - 1982 - Journal of Symbolic Logic 47 (3):495-548.
Limiting recursion.E. Mark Gold - 1965 - Journal of Symbolic Logic 30 (1):28-48.
Assigning Probabilities to Logical Formulas.Dana Scott & Peter Krauss - 1967 - In Jaakko Hintikka (ed.), Aspects of inductive logic. Amsterdam,: North Holland Pub. Co.. pp. 219 -- 264.

View all 6 references / Add more references