ABSTRACT
Inductive inference in the genuine sense should be distinguished also from certain types of demonstrative argument in logic and mathematics, which are called 'inductive'. There is a type of conclusive or demonstrative argument which bears a superficial resemblance to inductive inference. It is sometimes called complete, perfect, or non-problematic induction and contrasted with the inconclusive or non-demonstrative type of argument, which is then called Incomplete, Imperfect, or Problematic Induction. The chapter argues that the conclusions of inductive arguments of the second order are theories in the stronger sense of laws. It discusses conclusions of inductive arguments of the second order, i.e., with Universal Implications and Equivalences. In the case of total inclusion, the law is a Universal Implication or Equivalence. In the case of partial inclusion, the chapter considers the law a Statistical Law. A systematic treatment of what might be called the Logic of Quantitative Induction is another urgent desideratum in Inductive Logic.
