Hannes Leitgeb

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.

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

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 indicate that the proof strategies for all the theorems on the nonstandardness of such theories are "essentially" of the same kind of structure.

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

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

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

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 problems that affected the original Aufbau project. In particular, we are going to focus on how a new system may address the well-known difficulties in Carnap's Aufbau concerning abstraction, dimensionality, and theoretical terms

.  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 networks, artificial neural networks, logic programs, and evolutionary systems are instances of such interpreted dynamical systems, and thus our results entail that each of them may be described correctly and, in a sense, even completely by qualitative laws that obey the rules of a nonmonotonic logic system.

This is part A of a paper in which we defend a semantics for counterfactuals which is probabilistic in the sense that the truth condition for counterfactuals refers to a probability measure. Because of its probabilistic nature, it allows a counterfactual ‘ifAthenB’ to be true even in the presence of relevant ‘Aand notB’-worlds, as long such exceptions are not too widely spread. The semantics is made precise and studied in different versions which are related to each other by representation theorems. Despite its probabilistic nature, we show that the semantics and the resulting system of logic may be regarded as a naturalistically vindicated variant of David Lewis’ truth-conditional semantics and logic of counterfactuals. At the same time, the semantics overlaps in various ways with the non-truth-conditional suppositional theory for conditionals that derives from Ernest Adams’ work. We argue that counterfactuals have two kinds of pragmatic meanings and come attached with two types of degrees of acceptability or belief, one being suppositional, the other one being truth based as determined by our probabilistic semantics; these degrees could not always coincide due to a new triviality result for counterfactuals, and they should not be identified in the light of their different interpretation and pragmatic purpose. However, for plain assertability the difference between them does not matter. Hence, if the suppositional theory of counterfactuals is formulated with sufficient care, our truth-conditional theory of counterfactuals is consistent with it. The results of our investigation are used to assess a claim considered by Hawthorne and Hájek, that is, the thesis that most ordinary counterfactuals are false.

We present a way of classifying the logically possible ways out of Gärdenfors' inconsistency or triviality result on belief revision with conditionals. For one of these ways—conditionals which are not descriptive but which only have an inferential role as being given by the Ramsey test—we determine which of the assumptions in three different versions of Gärdenfors' theorem turn out to be false. This is done by constructing ranked models in which such Ramsey-test conditionals are evaluated and which are subject to natural postulates on belief revision and acceptability sets for conditionals. Along the way we show that in contrast with what Gärdenfors himself proposed, there is no dichotomy of the form: either the Ramsey test has to be given up or the Preservation condition. Instead, both of them follow from our postulates

We investigate the research programme of dynamic doxastic logic (DDL) and analyze its underlying methodology. The Ramsey test for conditionals is used to characterize the logical and philosophical differences between two paradigmatic systems, AGM and KGM, which we develop and compare axiomatically and semantically. The importance of Gärdenfors’s impossibility result on the Ramsey test is highlighted by a comparison with Arrow’s impossibility result on social choice. We end with an outlook on the prospects and the future of DDL.

One of the fundamental problems of epistemology is to say when the evidence in an agent’s possession justifies the beliefs she holds. In this paper and its prequel, we defend the Bayesian solution to this problem by appealing to the following fundamental norm: Accuracy An epistemic agent ought to minimize the inaccuracy of her partial beliefs. In the prequel, we made this norm mathematically precise; in this paper, we derive its consequences. We show that the two core tenets of Bayesianism follow from the norm, while the characteristic claim of the Objectivist Bayesian follows from the norm along with an extra assumption. Finally, we consider Richard Jeffrey’s proposed generalization of conditionalization. We show not only that his rule cannot be derived from the norm, unless the requirement of Rigidity is imposed from the start, but further that the norm reveals it to be illegitimate. We end by deriving an alternative updating rule for those cases in which Jeffrey’s is usually supposed to apply.

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

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.

The thesis defended in this article is that by uttering or publishing a great many declarative sentences in assertoric mode, one does not actually assert that their conjunction is true – one rather asserts that the vast majority of these sentences are true. Accordingly, the belief that is expressed thereby is the belief that the vast majority of these sentences are true. In the article, we make this proposal precise, we explain the context-dependency of belief that corresponds to it, we point out why our everyday oral practice of single assertions is not affected by it, and we argue that the proposal leads to a way out of the Paradox of the Preface

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 show that a set of prima facie plausible assumptions on the relation of meaning resemblance – one of which is a compositionality postulate – is inconsistent. On this basis we argue that either there is no theoretically useful notion of semantic resemblance at all, or the traditional conception of the compositionality of meaning has to be adapted. In the former case, arguments put forward by Nelson Goodman and Paul Churchland in favor of the concept of meaning resemblance are defeated. In the other case, it must be possible to account for 'degrees of compositionality' or for other refinements of compositionality that are compatible with meaning resemblance.