The psychological orientation treats semantics as a matter of idealized computation over symbolic structures, and semantic relations like denotation as relations between linguistic expressions and these structures. I argue that results similar to Gödel's incompleteness theorems and Tarski's theorem on truth create foundational difficulties for this view of semantics.

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 might be thought that we could argue for the consistency of a mathematical theory T within T, by giving an inductive argument that all theorems of T are true and inferring consistency. By Gödel's second incompleteness theorem any such argument must break down, but just how it breaks down depends on the kind of theory of truth that is built into T. The paper surveys the possibilities, and suggests that some theories of truth give far more intuitive diagnoses of (...) the breakdown than do others. The paper concludes with some morals about the nature of validity and about a possible alternative to the idea that mathematical theories are indefinitely extensible. (shrink)

An approach to the treatment of inference in the presence of uncertain truth values is described, based on representing uncertainties by sets of ordinary (certain) truth values. Both the algebraic and the logical aspects are studied for a variety of lattices used as truth value spaces in the domain of many-valued logic.

This paper explores the thesis that de re quantification into propositional attitudes has been wrongly conceived. One must never bind an individual variable in the context of a propositional attitude. Such quantification fails to respect the quantificational scaffolding of discursive thinking. This is the lesson of the Meinong–Russell debate over whether there are objects of thought about which it is true to say they are not. Respecting it helps to see how to solve contingent Liar paradoxes of propositional attitudes such (...) as Kripke’s Nixon–Jones. (shrink)

The paper contains a survey on the complexity of various truth hierarchies arising in Kripke’s theory. I present some new arguments, and use them to obtain a number of interesting generalisations of known results. These arguments are both relatively simple, involving only the basic machinery of constructive ordinals, and very general.

Intuitively, vagueness involves some sort of indeterminacy: if Plato is a borderline case of baldness, then there is no fact of the matter about whether or not he’s bald—he’s neither bald nor not bald. The leading formal treatments of such indeterminacy—three valued logic, supervaluationism, etc.—either fail to validate the classical theorems, or require that various classically valid inference rules be restricted. Here we show how a fully classical, yet indeterminist account of vagueness can be given within natural semantics, an alternative (...) semantics for classical proof theory. The key features of the account are: there is a single notion of truth—definite truth—and a single notion of validity; sentences can be true, false, or undetermined; all classical theorems and all classical inference rule are valid; the sorites argument is unsound; ‘definitely’ is treated as a meta-language predicate; higher-order vagueness is handled via semantic ascent. (shrink)

The author uses a series of examples to illustrate two versions of a new, nonprobabilist principle of epistemic rationality, the special and general versions of the metacognitive, expected relative frequency principle. These are used to explain the rationality of revisions to an agent’s degrees of confidence in propositions based on evidence of the reliability or unreliability of the cognitive processes responsible for them—especially reductions in confidence assignments to propositions antecedently regarded as certain—including certainty-reductions to instances of the law of excluded (...) middle or the law of noncontradiction in logic or certainty-reductions to the certainties of probabilist epistemology. The author proposes special and general versions of the MERF principle and uses them to explain the examples, including the reasoning that would lead to thoroughgoing fallibilism—that is, to a state of being certain of nothing. The author responds to the main defenses of probabilism: Dutch Book arguments, Joyce’s potential accuracy defense, and the potential calibration defenses of Shimony and van Fraassen by showing that, even though they do not satisfy the probability axioms, degrees of belief that satisfy the MERF principle minimize expected inaccuracy in Joyce’s sense; they can be externally calibrated in Shimony and van Fraassen’s sense; and they can serve as a basis for rational betting, unlike probabilist degrees of belief, which, in many cases, human beings have no rational way of ascertaining. The author also uses the MERF principle to subsume the various epistemic akrasia principles in the literature. Finally, the author responds to Titelbaum’s argument that epistemic akrasia principles require that we be certain of some epistemological beliefs, if we are rational. (shrink)

Uncut is a book about two kinds of paradoxes: paradoxes involving truth and its relatives, like the liar paradox, and paradoxes involving vagueness. There are lots of ways to look at these paradoxes, and lots of puzzles generated by them, and Uncut ignores most of this variety to focus on a single issue. That issue: do our words mean what they seem to mean, and if so, how can this be? I claim that our words do mean what they seem (...) to, and yet our language is not undermined by paradox. By developing a distinctive theory of meaning, I show how this can be. (shrink)

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.