, Volume 140, Issue 1–2, pp 97–119 | Cite as

Reasoning with Limited Resources and Assigning Probabilities to Arithmetical Statements

  • Haim Gaifman


Limit Resource Arithmetical Statement 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bell, E. T.: 1951, ‘The Queen of Mathematics’, reprinted in J. R. Newman (ed.), The World of Mathematics, Simon and Schuster (1956).Google Scholar
  2. Davidson, D.: 1976, ‘Hempel on Explaining Action’, Erkentnnis 10, 239-253. Reprinted in Davidson's 1989, Essays of Action and Events, Oxford. Page numbers refer to the book.Google Scholar
  3. De Milo, R. Lipton, and A. Perlis: 1979, ‘Social Processes and Proofs of Theorems and Programs’, Communication of the ACM, Vol. 22, No. 5. Reprinted in T. Tymozcko (ed.), New Directions in the Philosophy of Mathematics, Princeton University Press (1998). Page numbers refer to the book.Google Scholar
  4. Gaifman, H.: 1964, ‘Concerning Measures in First Order Calculi’, Israeli Journal of Mathematics 2, 1-18.Google Scholar
  5. Gaifman, H. and M. Snir: 1982, ‘Probabilities over Rich Languages, Testing and Randomness’, Journal of Symbolic Logic 43(3), 495-548.Google Scholar
  6. Garber, D.: 1983, ‘Old Evidence and Logical Omniscience in Bayesian Confirmation Theory’, in J. Earman (ed.), Testing Scientific Theories, Minnesota Studies in the Philosophy of Language, Vol. X, pp. 99-131.Google Scholar
  7. Hacking, I.: 1967, ‘Slightly More Realistic Personal Probability’, Philosophy of Science 34, 311-325.Google Scholar
  8. Levi, I.: 1991, The Fixation of Belief and Its Undoing, Cambridge University Press.Google Scholar
  9. Levi, I.: 1995, ‘The Logic of Full Belief’, in Levi's The Covenant of Reason, Cambridge University Press (1997), Chap. 3, pp. 40-69. Page numbers refer to the book.Google Scholar
  10. Rabin, M.: 1976, ‘Probabilistic Algorithms’, in J. Traub (ed.), Algorithms and Complexity, Recent Results and New Directions, Academic Press, New York, pp. 21-39.Google Scholar
  11. Rabin, M.: 1980, ‘Probabilistic Algorithm for Testing Primality’, Journal of Number Theory 12, 128-138Google Scholar
  12. Savage, L.: 1967, ‘Difficulty in the Theory of Personal Probability’, Philosophy of Science 34.Google Scholar
  13. Solovay, R. and V. Strassen: 1977, ‘A Fast Monte Carlo Test for Primality’, SIAM Journal of Computation 6, 84-85; Erratum (1978) ibidem 6 118.Google Scholar

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • Haim Gaifman
    • 1
  1. 1.Department of PhilosophyColumbia UniversityNew YorkU.S.A.

Personalised recommendations