An excellent introduction to mathematical logic, this book provides readers with a sound knowledge of the most important approaches to the subject, stressing the use of logical methods in attacking nontrivial problems. It covers the logic of classes, of propositions, of propositional functions, and the general syntax of language, with a brief introduction that also illustrates applications to so-called undecidability and incompleteness theorems. Other topics include the simple proof of the completeness of the theory of combinations, Church's theorem on the (...) recursive unsolvability of the decision problem for the restricted function calculus, and the demonstrable properties of a formal system as a criterion for its acceptability. 1950 ed. (shrink)

Teddy Seidenfeld recently claimed that Kolmogorov's probability theory transgresses the Substitutivity Law. Underscoring the seriousness of Seidenfeld's charge, the author shows that (Popper's version of) the law, to wit: If (∀ D)(Pr(B,D)=Pr(C,D)), then Pr(A,B)=Pr(A,C), follows from just C1. 0≤ Pr(A,B)≤ 1 C2. Pr(A,A)=1 C3. Pr(A & B,C)=Pr(A,B & C)× Pr(B,C) C4. Pr(A & B,C)=Pr(B & A,C) C5. Pr(A,B & C)=Pr(A,C & B), five constraints on Pr of the most elementary and most basic sort.