Two chief problems of the theory of knowledge are the question of meaning and the question of verification. The first question asks under what conditions a sentence has meaning, in the sense of cognitive, factual meaning. The second one asks how we get to know something, how we can find out whether a given sentence is true or false. The second question presupposes the first one. Obviously we must understand a sentence, i.e. we must know its meaning, before we can (...) try to find out whether it is true or not. But, from the point of view of empiricism, there is a still closer connection between the two problems. In a certain sense, there is only one answer to the two questions. If we knew what it would be for a given sentence to be found true then we would know what its meaning is. And if for two sentences the conditions under which we would have to take them as true are the same, then they have the same meaning. Thus the meaning of a sentence is in a certain sense identical with the way we determine its truth or falsehood; and a sentence has meaning only if such a determination is possible. (shrink)

A basic system of inductive logic; An axiomatic foundation for the logic of inductive generalization; A survey of inductive systems; On the condition of partial exchangeability; Representation theorems of the de finetti type; De finetti's generalizations of excahngeability; The structure of probabilities defined on first-order languages; A subjectivit's guide to objective chance.

APA PsycNET abstract: This is the first volume of a two-volume work on Probability and Induction. Because the writer holds that probability logic is identical with inductive logic, this work is devoted to philosophical problems concerning the nature of probability and inductive reasoning. The author rejects a statistical frequency basis for probability in favor of a logical relation between two statements or propositions. Probability "is the degree of confirmation of a hypothesis (or conclusion) on the basis of some given evidence (...) (or premises)." Furthermore, all principles and theorems of inductive logic are analytic, and the entire system is to be constructed by means of symbolic logic and semantic methods. This means that the author confines himself to the formalistic procedures of word and symbol systems. The resulting sentence or language structures are presumed to separate off logic from all subjectivist or psychological elements. Despite the abstractionism, the claim is made that if an inductive probability system of logic can be constructed it will have its practical application in mathematical statistics, and in various sciences. 16-page bibliography. (PsycINFO Database Record (c) 2016 APA, all rights reserved). (shrink)

With this treatise, an insightful exploration of the probabilistic connection between philosophy and the history of science, the famous economist breathed new life into studies of both disciplines. Originally published in 1921, this important mathematical work represented a significant contribution to the theory regarding the logical probability of propositions. Keynes effectively dismantled the classical theory of probability, launching what has since been termed the “logical-relationist” theory. In so doing, he explored the logical relationships between classifying a proposition as “highly probable” (...) and as a “justifiable induction.” Unabridged republication of the classic 1921 edition. (shrink)

Das Ziel: Konstitutionssystem der Begriffe Das Ziel der vorliegenden Untersuchungen ist die Aufstellung eines erkenntnismäßig-logischen Systems der ...

First published in 2000. Routledge is an imprint of Taylor & Francis, an informa company.

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)