Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings

Mathematical Logic Quarterly 34 (6):531-539 (1988)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,592

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

When probabilistic support is inductive.Alberto Mura - 1990 - Philosophy of Science 57 (2):278-289.
Topological aspects of numberings.Wolfram Menzel & Frank Stephan - 2003 - Mathematical Logic Quarterly 49 (2):129-149.
A note on partial numberings.Serikzhan Badaev & Dieter Spreen - 2005 - Mathematical Logic Quarterly 51 (2):129-136.
Cosmic Confusions: Not Supporting versus Supporting Not.John D. Norton - 2010 - Philosophy of Science 77 (4):501-523.
A material theory of induction.John D. Norton - 2003 - Philosophy of Science 70 (4):647-670.

Analytics

Added to PP
2013-12-01

Downloads
14 (#983,512)

6 months
5 (#627,481)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references