Hannes Leitgeb

Is it possible to give an explicit definition of belief in terms of subjective probability, such that believed propositions are guaranteed to have a sufficiently high probability, and yet it is neither the case that belief is stripped of any of its usual logical properties, nor is it the case that believed propositions are bound to have probability 1? We prove the answer is ‘yes’, and that given some plausible logical postulates on belief that involve a contextual “cautiousness” threshold, there is but one way of determining the extension of the concept of belief that does the job. The qualitative concept of belief is not to be eliminated from scientific or philosophical discourse, rather, by reducing qualitative belief to assignments of resiliently high degrees of belief and a “cautiousness” threshold, qualitative and quantitative belief turn out to be governed by one unified theory that offers the prospects of a huge range of applications. Within that theory, logic and probability theory are not opposed to each other but go hand in hand

While the Gödel centenary year 2006 triggered a lot of conference and workshop activity on Gödel, the years leading to it stand out by exhibiting several excellent publications on Gödel's life and work, most notably the completion of the Kurt Gödel Collected Works series . The two volumes of Kurt Gödel. Wahrheit & Beweisbarkeit, written in German and edited by E. Köhler et al., constitute something like the ‘German-Austrian contribution’ to this renewal of interest in Gödel's legacy, even though not all of the articles in the volumes actually have German or Austrian authors.2 Indeed, as P. Weibel explains in the preface of the first volume, one of the intentions of the editors was to present Gödel as part of the cultural history of Austria. At the same time, the volumes highlight the contrast between Gödel's national reception—or lack thereof—and the way in which he was perceived and appreciated internationally, and although this discrepancy is now fortunately a thing of the past, its history is worth documenting. In this respect the two volumes will be of lasting value and importance, and the editors must be given credit not just for recording Gödel's delayed acceptance by Austrian politicians and university headquarters, but also for promoting Gödel's case. This being said, there is something extravagant and slightly queer about the two Kurt Gödel. Wahrheit & Beweisbarkeit volumes. Parts of them seem to be written for a generally educated audience, while other parts will be understandable only to logicians and philosophers who specialize in the topics covered. The volumes consist partly of biographical essays, interviews about Gödel, photos of him and his family, and letters by or to him, but they also include several non-historical articles which use …

This paper suggests a bridge principle for all-or-nothing belief and degrees of belief to the effect that belief corresponds to stably high degree of belief. Different ways of making this Humean thesis on belief precise are discussed, and one of them is shown to stand out by unifying the others. The resulting version of the thesis proves to be fruitful in entailing the logical closure of belief, the Lockean thesis on belief, and coherence between decision-making based on all-or-nothing beliefs and on degrees of belief.

On the basis of impossibility results on probability, belief revision, and conditionals, it is argued that conditional beliefs differ from beliefs in conditionals qua mental states. Once this is established, it will be pointed out in what sense conditional beliefs are still conditional, even though they may lack conditional contents, and why it is permissible to still regard them as beliefs, although they are not beliefs in conditionals. Along the way, the main logical, dispositional, representational, and normative properties of conditional beliefs are studied, and it is explained how the failure of not distinguishing conditional beliefs from beliefs in conditionals can lead philosophical and empirical theories astray.

We will present a new lottery-style paradox on counterfactuals and chance. The upshot will be: combining natural assumptions on the truth values of ordinary counterfactuals, the conditional chances of possible but non-actual events, the manner in which and relate to each other, and a fragment of the logic of counterfactuals leads to disaster. In contrast with the usual lottery-style paradoxes, logical closure under conjunction—that is, in this case, the rule of Agglomeration of counterfactuals—will not play a role in the derivation and will not be entailed by our premises either. We will sketch four obvious but problematic ways out of the dilemma, and we will end up with a new resolution strategy that is non-obvious but less problematic: contextualism about what counts as a proposition. This proposal will not just save us from the paradox, it will also save each premise in at least some context, and it will be motivated by independent considerations from measure theory and probability theory

If □ is conceived as an operator, i.e., an expression that gives applied to a formula another formula, the expressive power of the language is severely restricted when compared to a language where □ is conceived as a predicate, i.e., an expression that yields a formula if it is applied to a term. This consideration favours the predicate approach. The predicate view, however, is threatened mainly by two problems: Some obvious predicate systems are inconsistent, and possible-worlds semantics for predicates of sentences has not been developed very far. By introducing possible-worlds semantics for the language of arithmetic plus the unary predicate □, we tackle both problems. Given a frame (W, R) consisting of a set W of worlds and a binary relation R on W, we investigate whether we can interpret □ at every world in such a way that □ $\ulcorner A \ulcorner$ holds at a world ᵆ ∊ W if and only if A holds at every world $\upsilon$ ∊ W such that ᵆR $\upsilon$ . The arithmetical vocabulary is interpreted by the standard model at every world. Several 'paradoxes' (like Montague's Theorem, Gödel's Second Incompleteness Theorem, McGee's Theorem on the ω-inconsistency of certain truth theories, etc.) show that many frames, e.g., reflexive frames, do not allow for such an interpretation. We present sufficient and necessary conditions for the existence of a suitable interpretation of □ at any world. Sound and complete semi-formal systems, corresponding to the modal systems K and K4, for the class of all possible-worlds models for predicates and all transitive possible-worlds models are presented. We apply our account also to nonstandard models of arithmetic and other languages than the language of arithmetic

What kinds of sentences with truth predicate may be inserted plausibly and consistently into the T-scheme? We state an answer in terms of dependence: those sentences which depend directly or indirectly on non-semantic states of affairs (only). In order to make this precise we introduce a theory of dependence according to which a sentence φ is said to depend on a set Φ of sentences iff the truth value of φ supervenes on the presence or absence of the sentences of Φ in/from the extension of the truth predicate. Both φ and the members of Φ are allowed to contain the truth predicate. On that basis we are able define notions such as ungroundedness or self-referentiality within a classical semantics, and we can show that there is an adequate definition of truth for the class of sentences which depend on non-semantic states of affairs

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.

This monograph provides a new account of justified inference as a cognitive process. In contrast to the prevailing tradition in epistemology, the focus is on low-level inferences, i.e., those inferences that we are usually not consciously aware of and that we share with the cat nearby which infers that the bird which she sees picking grains from the dirt, is able to fly. Presumably, such inferences are not generated by explicit logical reasoning, but logical methods can be used to describe and analyze such inferences. Part 1 gives a purely system-theoretic explication of belief and inference. Part 2 adds a reliabilist theory of justification for inference, with a qualitative notion of reliability being employed. Part 3 recalls and extends various systems of deductive and nonmonotonic logic and thereby explains the semantics of absolute and high reliability. In Part 4 it is proven that qualitative neural networks are able to draw justified deductive and nonmonotonic inferences on the basis of distributed representations. This is derived from a soundness/completeness theorem with regard to cognitive semantics of nonmonotonic reasoning. The appendix extends the theory both logically and ontologically, and relates it to A. Goldman's reliability account of justified belief. This text will be of interest to epistemologists and logicians, to all computer scientists who work on nonmonotonic reasoning and neural networks, and to cognitive scientists.

We show that finitely axiomatized first-order theories that involve some criterion of identity for entities of a category C can be reformulated as conjunctions of a non-triviality statement and a criterion of identity for entities of category C again. From this, we draw two conclusions: First, criteria of identity can be very strong deductively. Second, although the criteria of identity that are constructed in the proof of the theorem are not good ones intuitively, it is difficult to say what exactly is wrong with them once the modern metaphysical view of identity criteria is presupposed.

This is the second part of a paper dealing with truth and translation. In Part A a revised version of Tarski's Convention T has been presented, which explicitly refers to a translation mapping from the object language to the metalanguage; the vague notion of a translation has been replaced by a precise definition. At the end of Part A it has been shown that interpreted languages exist, which allow for vicious self-reference but which nevertheless contain their own truth predicate - this is possible if truth is based on a nonstandard translation mapping. However, this result has only been proved for languages without quantifiers. In Part B we now extend the result to first-order languages, and we show that this can be done in three different ways. In each case, the addition of a truth predicate to an interpreted language with a high degree of expressiveness leads to changes in the ontology of the language

We investigate the conditions under which quasianalysis, i.e., Carnap's method of abstraction in his Aufbau, yields adequate results. In particular, we state both necessary and sufficient conditions for the so-called faithfulness and fullness of quasianalysis, and analyze adequacy as the conjunction of faithfulness and fullness. It is shown that there is no method of (re-)constructing properties from similarity that delivers adequate results in all possible cases, if the same set of individuals is presupposed for properties and for similarity, and if similarity is a relation of finite arity. The theory is applied to various examples, including Russell's construction of temporal instants and Carnap's constitution of the phenomenal counterparts to quality spheres. Our results explain why the former is adequate while the latter is bound to fail

The aim of this paper is to give a certain algebraic account of truth: we want to define what we mean by De Morgan-valued truth models and show their existence even in the case of semantical closure: that is, languages may contain their own truth predicate if they are interpreted by De Morgan-valued models. Before we can prove this result, we have to repeat some basic facts concerning De Morgan-valued models in general, and we will introduce a notion of truth both on the object- and on the metalanguage level appropriate for such models. The definitions and the existence theorem are extensions of Kripke's, Woodruff's, and Visser's concepts and results concerning three- and four-valued truth models

If an agent believes that the probability of E being true is 1/2, should she accept a bet on E at even odds or better? Yes, but only given certain conditions. This paper is about what those conditions are. In particular, we think that there is a condition that has been overlooked so far in the literature. We discovered it in response to a paper by Hitchcock (2004) in which he argues for the 1/3 answer to the Sleeping Beauty problem. Hitchcock argues that this credence follows from calculating her fair betting odds, plus the assumption that Sleeping Beauty’s credences should track her fair betting odds. We will show that this last assumption is false. Sleeping Beauty’s credences should not follow her fair betting odds due to a peculiar feature of her epistemic situation.