Circular denitions have primarily been studied in revision theory in the classical scheme. I present systems of circular denitions in the Strong Kleene and supervaluation schemes and provide complete proof systems for them. One class of denitions, the intrinsic denitions, naturally arises in both schemes. I survey some of the features of this class of denitions.

What sort of logic do we get if we adopt a supervaluational semantics for vagueness? As it turns out, the answer depends crucially on how the standard notion of validity as truth preservation is recasted. There are several ways of doing that within a supervaluational framework, the main alternative being between “global” construals (e.g., an argument is valid iff it preserves truth-under-all-precisifications) and “local” construals (an argument is valid iff, under all precisifications, it preserves truth). The former alternative is by (...) far more popular, but I argue in favor of the latter, for (i) it does not suffer from a number of serious objections, and (ii) it makes it possible to restore global validity as a defined notion. (shrink)

This volume presents mathematical game theory as an interface between logic and philosophy.

In a previous paper (see ‘Tolerant, Classical, Strict’, henceforth TCS) we investigated a semantic framework to deal with the idea that vague predicates are tolerant, namely that small changes do not affect the applicability of a vague predicate even if large changes do. Our approach there rests on two main ideas. First, given a classical extension of a predicate, we can define a strict and a tolerant extension depending on an indifference relation associated to that predicate. Second, we can use (...) these notions of satisfaction to define mixed consequence relations that capture non-transitive tolerant reasoning. Although we gave some empirical motivation for the use of strict and tolerant extensions, making use of them commits us to the view that sentences of the form ‘ p∨¬p ’ and ‘ p∧¬p ’ are not automatically valid or unsatisfiable, respectively. Some philosophers might take this commitment as a negative outcome of our previous proposal. We think, however, that the general ideas underlying our previous approach to vagueness can be implemented in a variety of ways. This paper explores the possibility of defining mixed notions of consequence in the more classical super/sub-valuationist setting and examines to what extent any of these notions captures non-transitive tolerant reasoning. (shrink)

Michael Kremer defines fixed-point logics of truth based on Saul Kripke’s fixed point semantics for languages expressing their own truth concepts. Kremer axiomatizes the strong Kleene fixed-point logic of truth and the weak Kleene fixed-point logic of truth, but leaves the axiomatizability question open for the supervaluation fixed-point logic of truth and its variants. We show that the principal supervaluation fixed point logic of truth, when thought of as consequence relation, is highly complex: it is not even analytic. We also (...) consider variants, engendered by a stronger notion of ‘fixed point’, and by variant supervaluation schemes. A ‘logic’ is often thought of, not as a consequence relation, but as a set of sentences – the sentences true on each interpretation. We axiomatize the supervaluation fixed-point logics so conceived. (shrink)

In his "From classical to constructive probability," Weatherson offers a generalization of Kolmogorov's axioms of classical probability that is neutral regarding the logic for the object-language. Weatherson's generalized notion of probability can hardly be regarded as adequate, as the example of supervaluationist logic shows. At least, if we model credences as betting rates, the Dutch-Book argument strategy does not support Weatherson's notion of supervaluationist probability, but various alternatives. Depending on whether supervaluationist bets are specified as (a) conditional bets (Cantwell), (b) (...) unconditional bets with graded payoffs (Milne), or (c) unconditional bets with ungraded payoffs(Dietz), supervaluationist probability amounts to (a) conditional probability of truth given a truth-value, (b) the expected truth-value, or (c) the probability of truth, respectively. It is suggested that for supervaluationist logic, the third option is the most attractive one, for (unlike the other options) it preserves respect for single-premise entailment. (shrink)

Kripke’s theory of truth is arguably the most influential approach to self-referential truth and the semantic paradoxes. The use of a partial evaluation scheme is crucial to the theory and the most prominent schemes that are adopted are the strong Kleene and the supervaluation scheme. The strong Kleene scheme is attractive because it ensures the compositionality of the notion of truth. But under the strong Kleene scheme classical tautologies do not, in general, turn out to be true and, as a (...) consequence, classical reasoning is no longer admissible once the notion of truth is involved. The supervaluation scheme adheres to classical reasoning but violates compositionality. Moreover, it turns Kripke’s theory into a rather complicated affair: to check whether a sentence is true we have to look at all admissible precisification of the interpretation of the truth predicate we are presented with. One consequence of this complicated evaluation condition is that under the supervaluation scheme a more proof-theoretic characterization of Kripke’s theory becomes inherently difficult, if not impossible. In this paper we explore the middle ground between the strong Kleene and the supervaluation scheme and provide an evaluation scheme that adheres to classical reasoning but retains many of the attractive features of the strong Kleene scheme. We supplement our semantic investigation with a novel axiomatic theory of truth that matches the semantic theory we have put forth. (shrink)

It is often assumed that the supervaluationist theory of vagueness is committed to a global notion of logical consequence, in contrast with the local notion characteristic of modal logics. There are, at least, two problems related to the global notion of consequence. First, it brings some counterexamples to classically valid patterns of inference. Second, it is subject to an objection related to higher-order vagueness . This paper explores a third notion of logical consequence, and discusses its adequacy for the supervaluationist (...) theory. The paper proceeds in two steps. In the first step, the paper provides a deductive notion of consequence for global validity using the tableaux method. In the second step, the paper provides a notion of logical consequence which is an alternative to global validity, and discusses i) whether it is acceptable to the supervaluationist and ii) whether it plays a better role in a theory of vagueness in the face of the problems related to the global notion. (shrink)