It is natural and important to have a formal representation of plain belief, according to which propositions are held true, or held false, or neither. (In the paper this is called a deterministic representation of epistemic states). And it is of great philosophical importance to have a dynamic account of plain belief. AGM belief revision theory seems to provide such an account, but it founders at the problem of iterated belief revision, since it can generally account only for one step (...) of revision. The paper discusses and rejects two solutions within the confines of AGM theory. It then introduces ranking functions (as I prefer to call them now; in the paper they are still called ordinal conditional functions) as the proper (and, I find, still the best) solution of the problem, proves that conditional independence w.r.t. ranking functions satisfies the so-called graphoid axioms, and proposes general rules of belief change (in close analogy to Jeffrey's generalized probabilistic conditionalization) that encompass revision and contraction as conceived in AGM theory. Indeed, the parallel to probability theory is amazing. Probability theory can profit from ranking theory as well since it is also plagued by the problem of iterated belief revision even if probability measures are conceived as Popper measures (see No. 11). Finally, the theory is compared with predecessors which are numerous and impressive, but somehow failed to explain the all-important conditional ranks in the appropriate way. (shrink)

Many years ago, C.B. Martin drew our attention to the possibility of ‘finkish’ dispositions: dispositions which, if put to the test would not be manifested, but rather would disappear. Thus if x if finkishly disposed to give response r to stimulus s, it is not so that if x were subjected to stimulus r, x would give response z; so finkish dispositions afford a counter‐example to the simplest conditional analysis of dispositions. Martin went on to suggest that finkish dispositions required (...) a theory of primitive causal powers; there, I think, he was mistaken. All that they require is an improved conditional analysis, and this improved analysis can be built upon whatever treatments of properties and of laws we may favour on other grounds. (shrink)

The characteristic difference between laws and accidental generalizations lies in our epistemic or inductive attitude towards them. This idea has taken various forms and dominated the discussion about lawlikeness in the last decades. Likewise, the issue about ceteris paribus conditions is essentially about how we epistemically deal with exceptions. Hence, ranking theory with its resources of defeasible reasoning seems ideally suited to explicate these points in a formal way. This is what the paper attempts to do. Thus it will turn (...) out that a law is simply the deterministic analogue of a sequence of independent, identically distributed random variables. This entails that de Finetti's representation theorems can be directly transformed into an account of confirmation of laws thus conceived. (shrink)

The first Ukrainian translation of the most famous Quine’s article (1951), which became one of the classic texts of Analytical Philosophy.

Hartry Field; XV*—The A Prioricity of Logic, Proceedings of the Aristotelian Society, Volume 96, Issue 1, 1 June 1996, Pages 359–380, https://doi.org/10.1093/ar.