Minimalism, Supervaluations and Fixed Points

In this paper I introduce Horwich's deflationary theory of truth, called 'Minimalism', and I present his proposal of how to cope with the Liar Paradox. The proposal proceeds by restricting the T-schema and, as a consequence of that, it needs a constructive specification of which instances of the T-schema are to be excluded from Minimalism. Horwich has presented, in an informal way, one construction that specifies the Minimalist theory. The main aim of the paper is to present and scrutinize some formal versions of Horwich's construction

Modes of Truth

The aim of this volume is to open up new perspectives and to raise new research questions about a unified approach to truth, modalities, and propositional attitudes. The volume’s essays are grouped thematically around different research questions. The first theme concerns the tension between the theoretical role of the truth predicate in semantics and its expressive function in language. The second theme of the volume concerns the interaction of truth with modal and doxastic notions. The third theme covers higher-order solutions to the semantic and modal paradoxes, providing an alternative to first-order solutions embraced in the first two themes. This book will be of interest to researchers working in epistemology, logic, philosophy of logic, philosophy of language, philosophy of mathematics, and semantics

Type-free truth

This book is a contribution to the flourishing field of formal and philosophical work on truth and the semantic paradoxes. Our aim is to present several theories of truth, to investigate some of their model-theoretic, recursion-theoretic and proof-theoretic aspects, and to evaluate their philosophical significance. In Part I we first outline some motivations for studying formal theories of truth, fix some terminology, provide some background on Tarski’s and Kripke’s theories of truth, and then discuss the prospects of classical type-free truth. In Chapter 4 we discuss some minimal adequacy conditions on a satisfactory theory of truth based on the function that the truth predicate is intended to fulfil on the deflationist account. We cast doubt on the adequacy of some non-classical theories of truth and argue in favor of classical theories of truth. Part II is devoted to grounded truth. In chapter 5 we introduce a game-theoretic semantics for Kripke’s theory of truth. Strategies in these games can be interpreted as reference-graphs (or dependency-graphs) of the sentences in question. Using that framework, we give a graph-theoretic analysis of the Kripke-paradoxical sentences. In chapter 6 we provide simultaneous axiomatizations of groundedness and truth, and analyze the proof-theoretic strength of the resulting theories. These range from conservative extensions of Peano arithmetic to theories that have the full strength of the impredicative system ID1. Part III investigates the relationship between truth and set-theoretic comprehen- sion. In chapter 7 we canonically associate extensions of the truth predicate with Henkin-models of second-order arithmetic. This relationship will be employed to determine the recursion-theoretic complexity of several theories of grounded truth and to show the consistency of the latter with principles of generalized induction. In chapter 8 it is shown that the sets definable over the standard model of the Tarskian hierarchy are exactly the hyperarithmetical sets. Finally, we try to apply a certain solution to the set-theoretic paradoxes to the case of truth, namely Quine’s idea of stratification. This will yield classical disquotational theories that interpret full second-order arithmetic without set parameters, Z2- (chapter 9). We also indicate a method to recover the parameters. An appendix provides some background on ordinal notations, recursion theory and graph theory

Weakly Classical Theories of Identity

There are well-known quasi-formal arguments that identity is a "strict" relation in at least the following three senses: (1) There is a single identity relation and a single distinctness relation; (2) There are no contingent cases of identity or distinctness; and (3) There are no vague or indeterminate cases of identity or distinctness. However, the situation is less clear cut than it at first may appear. There is a natural formal theory of identity that is very close to the standard classical theory but which does not validate the formal analogues of (1)-(3). The core idea is simple: We weaken the Principle of the Indiscernibility of Identicals from a conditional to an entailment and we adopt a weakly classical logic. This paper investigates this weakly classical theory of identity (and related theories) and discusses its philosophical ramications. It argues that we can accept a reasonable theory of identity without committing ourselves to the uniqueness, necessity, or determinacy of identity

Strict finitism, feasibility, and the sorites

This paper bears on four topics: observational predicates and phenomenal properties, vagueness, strict finitism as a philosophy of mathematics, and the analysis of feasible computability. It is argued that reactions to strict finitism point towards a seman- tics for vague predicates in the form of nonstandard models of weak arithmetical theories of the sort originally introduced to characterize the notion of feasibility as understood in computational complexity theory. The approach described eschews the use of non-classical logic and related devices like degrees of truth or supervaluation. Like epistemic approaches to vagueness, it may thus be smoothly integrated with the use of classical model theory as widely employed in natural language semantics. But unlike epistemicism, the described approach fails to imply either the existence of sharp boundaries or the failure of tolerance for soritical predicates. Applications of measurement theory (in the sense of Krantz et al. 1971) to vagueness in the nonstandard setting are also explored