•  146
    Werning applies a theorem by Hodges in order to put forward an argument against Quine's thesis of the indeterminacy of translation and in favour of what Werning calls 'semantic realism'. We show that the argument rests on two critical premises both of which are false. The reasons for these failures are explained and the actual place of this application of Hodges' theorem within Quine's philosophy of language is outlined.
  •  547
    The Stability Theory of Belief
    Philosophical Review 123 (2): 131-171. 2014.
    This essay develops a joint theory of rational (all-or-nothing) belief and degrees of belief. The theory is based on three assumptions: the logical closure of rational belief; the axioms of probability for rational degrees of belief; and the so-called Lockean thesis, in which the concepts of rational belief and rational degree of belief figure simultaneously. In spite of what is commonly believed, this essay will show that this combination of principles is satisfiable (and indeed nontrivially so…Read more
  •  216
    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…Read more
  •  330
    Scientific Philosophy, Mathematical Philosophy, and All That
    Metaphilosophy 44 (3): 267-275. 2013.
    This article suggests that scientific philosophy, especially mathematical philosophy, might be one important way of doing philosophy in the future. Along the way, the article distinguishes between different types of scientific philosophy; it mentions some of the scientific methods that can serve philosophers; it aims to undermine some worries about mathematical philosophy; and it tries to make clear why in certain cases the application of mathematical methods is necessary for philosophical progr…Read more
  •  2142
    When betting odds and credences come apart: more worries for Dutch book arguments
    with Darren Bradley
    Analysis 66 (2): 119-127. 2006.
    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 he…Read more
  •  236
    On the probabilistic convention T
    Review of Symbolic Logic 1 (2): 218-224. 2008.
    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
  •  77
  •  319
    What Truth Depends on
    Journal of Philosophical Logic 34 (2): 155-192. 2005.
    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 tr…Read more
  •  325
    Criteria of Identity: Strong and Wrong
    British Journal for the Philosophy of Science 64 (1): 61-68. 2013.
    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 ex…Read more
  •  172
    A New Analysis of Quasianalysis
    Journal of Philosophical Logic 36 (2): 181-226. 2007.
    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 …Read more
  •  176
    Theories of truth which have no standard models
    Studia Logica 68 (1): 69-87. 2001.
    This papers deals with the class of axiomatic theories of truth for semantically closed languages, where the theories do not allow for standard models; i.e., those theories cannot be interpreted as referring to the natural number codes of sentences only (for an overview of axiomatic theories of truth in general, see Halbach[6]). We are going to give new proofs for two well-known results in this area, and we also prove a new theorem on the nonstandardness of a certain theory of truth. The results…Read more
  •  314
    Possible-worlds semantics for modal notions conceived as predicates
    Journal of Philosophical Logic 32 (2): 179-223. 2003.
    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 p…Read more
  •  181
    Reducing belief simpliciter to degrees of belief
    Annals of Pure and Applied Logic 164 (12): 1338-1389. 2013.
    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…Read more
  •  577
    New Life for Carnap’s Aufbau?
    Synthese 180 (2): 265-299. 2011.
    Rudolf Carnap's Der logische Aufbau der Welt (The Logical Structure of the World) is generally conceived of as being the failed manifesto of logical positivism. In this paper we will consider the following question: How much of the Aufbau can actually be saved? We will argue that there is an adaptation of the old system which satisfies many of the demands of the original programme. In order to defend this thesis, we have to show how a new 'Aufbau-like' programme may solve or circumvent the probl…Read more
  •  69
    Introduction
    Synthese 146 (1-2): 1-5. 2005.
  •  157
    .  Interpreted dynamical systems are dynamical systems with an additional interpretation mapping by which propositional formulas are assigned to system states. The dynamics of such systems may be described in terms of qualitative laws for which a satisfaction clause is defined. We show that the systems Cand CL of nonmonotonic logic are adequate with respect to the corresponding description of the classes of interpreted ordered and interpreted hierarchical systems, respectively. Inhibition networ…Read more