In this paper a theory of finitistic and frequentistic approximations — in short: f-approximations — of probability measures P over a countably infinite outcome space N is developed. The family of subsets of N for which f-approximations converge to a frequency limit forms a pre-Dynkin system $${{D\subseteq\wp(N)}}$$. The limiting probability measure over D can always be extended to a probability measure over $${{\wp(N)}}$$, but this measure is not always σ-additive. We conclude that probability measures can be regarded as idealizations of (...) limiting frequencies if and only if σ-additivity is not assumed as a necessary axiom for probabilities. We prove that σ-additive probability measures can be characterized in terms of so-called canonical and in terms of so-called full f-approximations. We also show that every non-σ-additive probability measure is f-approximable, though neither canonically nor fully f-approximable. Finally, we transfer our results to probability measures on open or closed formulas of first-order languages. (shrink)

Van Fraassen famously endorses the Principle of Reflection as a constraint on rational credence, and argues that Reflection is entailed by the more traditional principle of Conditionalization. He draws two morals from this alleged entailment. First, that Reflection can be regarded as an alternative to Conditionalization – a more lenient standard of rationality. And second, that commitment to Conditionalization can be turned into support for Reflection. Van Fraassen also argues that Reflection implies Conditionalization, thus offering a new justification for Conditionalization. (...) I argue that neither principle entails the other, and thus neither can be used to motivate the other in the way van Fraassen says. There are ways to connect Conditionalization to Reflection, but these connections depend on poor assumptions about our introspective access, and are not tight enough to draw the sorts of conclusions van Fraassen wants. Upon close examination, the two principles seem to be getting at two quite independent epistemic norms. (shrink)

To the axioms of Peano arithmetic formulated in a language with an additional unary predicate symbol T we add the rules of necessitation and conecessitation T and axioms stating that T commutes with the logical connectives and quantifiers. By a result of McGee this theory is -inconsistent, but it can be approximated by models obtained by a kind of rule-of-revision semantics. Furthermore we prove that FS is equivalent to a system already studied by Friedman and Sheard and give an analysis (...) of its proof theory. (shrink)

This is surely a bit of Socrates' famous irony. He draws the analogy to explain how his friends should regard poetry as they regretfully banish it from the ideal state. But lovers were no more sensible then than they are now. The advice to banish poetry, undermined already by Plato's own delight and skill in drama, is perhaps undermined still further by this evocation of a 'sensible' lover who counts love so well lost. Yet Socrates' image is one of avowed (...) rationality and prudence. The sensible lover imitates the older literary example of Ulysses' tying himself to the mast. (The example belongs therefore to the class of problems treated in Elster (1979)). Both this lover and Ulysses foresee that under certain possible future conditions, their opinions, values and preferences will or would differ from what they are now, in a very definite fashion. To what extent is such foresight possible? Correspondingly (when we do not claim foreknowledge) to what extent is such opinion reasonable, rational, coherent, or consistent in some suitably broad sense? It is not easy to understand exactly what is possible or even logically permissible in this respect. In an earlier paper, "Belief and the Will", I argued for a principle ("Reflection") to govern such deliberation. Here I will both generalize the treatment of opinion in "Belief and the Will" and respond to criticism. Critical examples mainly resembled the story of Ulysses who foresaw a period of dysfunction (at the sound 2 of the sirens) in his epistemic and/or doxastic future. Other criticism focused on the model of opinion used (precise numerical subjective probability) and on the merits of Dutch Book arguments. The present argument will not rely on Dutch Book arguments and strategies, and the Reflection principle will be formulated so as to apply also to vague opinion. (shrink)

A subtheory of the theory of self-referential truth known as FS is shown to be weak as a theory of truth but equivalent to full FS in its proof-theoretic strength.

Justified belief is a core concept in epistemology and there has been an increasing interest in its logic over the last years. While many logical investigations consider justified belief as an operator, in this paper, we propose a logic for justified belief in which the relevant notion is treated as a predicate instead. Although this gives rise to the possibility of liar-like paradoxes, a predicate treatment allows for a rich and highly expressive framework, which lives up to the universal ambitions (...) of investigating epistemological concepts. We start with a base theory for justified belief, and then systematically present putative additional axioms for justified belief. We provide an overview of consistency results when the additional principles are added to the base theory, and discuss their philosophical plausibility. (shrink)

Certain situations seem to call for acknowledging the possibility that one’s own beliefs are biased or distorted. On the other hand, certain sorts of epistemic self-doubts (such as ‘I believe it’s raining, but it’s not’) seem paradoxical. And some have put forth epistemic principles requiring rational agents to regard their own credences as so-called ‘expert functions’. This paper examines the question of whether rationality requires agents to respect their own credences in a way in which they need not respect the (...) credences of others. (shrink)

We introduce an epistemic theory of truth according to which the same rational degree of belief is assigned to Tr(. It is shown that if epistemic probability measures are only demanded to be finitely additive (but not necessarily σ-additive), then such a theory is consistent even for object languages that contain their own truth predicate. As the proof of this result indicates, the theory can also be interpreted as deriving from a quantitative version of the Revision Theory of Truth.

Many people believe that there is a Dutch Book argument establishing that the principle of countable additivity is a condition of coherence. De Finetti himself did not, but for reasons that are at first sight perplexing. I show that he rejected countable additivity, and hence the Dutch Book argument for it, because countable additivity conflicted with intuitive principles about the scope of authentic consistency constraints. These he often claimed were logical in nature, but he never attempted to relate this idea (...) to deductive logic and its own concept of consistency. This I do, showing that at one level the definitions of deductive and probabilistic consistency are identical, differing only in the nature of the constraints imposed. In the probabilistic case I believe that R.T. Cox's ‘scale-free’ axioms for subjective probability are the most suitable candidates. 1 Introduction 2 Coherence and Consistency 3 The Infinite Fair Lottery 4 The Puzzle Resolved—But Replaced by Another 5 Countable Additivity, Conglomerability and Dutch Books 6 The Probability Axioms and Cox's Theorem 7 Truth and Probability 8 Conclusion: ‘Logical Omniscience’ CiteULike Connotea Del.icio.us What's this? (shrink)

This article studies three most basic systems of truth as well as their subsystems over set theory ZF possibly with AC or the axiom of global choice GC, and then correlates them with subsystems of Morse–Kelley class theory MK. The article aims at making an initial step towards the axiomatic study of truth in set theory in connection with class theory. Some new results on the side of class theory, such as conservativity, forcing and some forms of the reflection principle, (...) are also presented. The equivalence results among systems of truth and classes obtained in this article are summarized in Theorem 104 , Theorem 107 and Theorem 108. (shrink)

We investigate how to assign probabilities to sentences that contain a type-free truth predicate. These probability values track how often a sentence is satisfied in transfinite revision sequences, following Gupta and Belnap’s revision theory of truth. This answers an open problem by Leitgeb which asks how one might describe transfinite stages of the revision sequence using such probability functions. We offer a general construction, and explore additional constraints that lead to desirable properties of the resulting probability function. One such property (...) is Leitgeb’s Probabilistic Convention T, which says that the probability of φ equals the probability that φ is true. (shrink)

Non-Archimedean probability functions allow us to combine regularity with perfect additivity. We discuss the philosophical motivation for a particular choice of axioms for a non-Archimedean probability theory and answer some philosophical objections that have been raised against infinitesimal probabilities in general. _1_ Introduction _2_ The Limits of Classical Probability Theory _2.1_ Classical probability functions _2.2_ Limitations _2.3_ Infinitesimals to the rescue? _3_ NAP Theory _3.1_ First four axioms of NAP _3.2_ Continuity and conditional probability _3.3_ The final axiom of NAP (...) _3.4_ Infinite sums _3.5_ Definition of NAP functions via infinite sums _3.6_ Relation to numerosity theory _4_ Objections and Replies _4.1_ Cantor and the Archimedean property _4.2_ Ticket missing from an infinite lottery _4.3_ Williamson’s infinite sequence of coin tosses _4.4_ Point sets on a circle _4.5_ Easwaran and Pruss _5_ Dividends _5.1_ Measure and utility _5.2_ Regularity and uniformity _5.3_ Credence and chance _5.4_ Conditional probability _6_ General Considerations _6.1_ Non-uniqueness _6.2_ Invariance Appendix. (shrink)