Proving Induction

Australasian Journal of Logic 10:1-17 (2011)
  Copy   BIBTEX

Abstract

The hard problem of induction is to argue without begging the question that inductive inference, applied properly in the proper circumstances, is conducive to truth. A recent theorem seems to show that the hard problem has a deductive solution. The theorem, provable in ZFC, states that a predictive function M exists with the following property: whatever world we live in, M ncorrectly predicts the world’s present state given its previous states at all times apart from a well-ordered subset. On the usual model of time a well-ordered subset is small relative to the set of all times. M’s existence therefore seems to provide a solution to the hard problem. My paper argues for two conclusions. First, the theorem does not solve the hard problem of induction. More positively though, it solves a version of the problem in which the structure of time is given modulo our choice of set theory.

Analytics

Added to PP
2015-02-04

Downloads
348 (#6,997)

6 months
77 (#209,698)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

A. C. Paseau
University of Oxford

Citations of this work

Non-deductive justification in mathematics.A. C. Paseau - 2023 - Handbook of the History and Philosophy of Mathematical Practice.

Add more citations

References found in this work

The problem of induction.H. R. Smart - 1928 - Journal of Philosophy 25 (1):18-20.

Add more references