A number of philosophers have argued that the key to understanding the semantic paradoxes is to recognize that truth is essentially relative to context. All of these philosophers have been motivated by the idea that once a liar sentence has been uttered we can 'step back' and, from the point of view of a different context, judge that the liar sentence is true. This paper argues that this 'stepping back' idea is a mistake that results from failing to relativize truth (...) to context in the first place. Moreover, context-relative liar sentences, such as 'This sentence is not true in any context' present a paradox even after truth has been relativized to context. Nonetheless, the relativization of truth to context may offer us the means to avoid paradox, if we can justifiably deny that a sentence about a context can be true in the very context it is about. (shrink)

In what follows, I analyze Ralph Strode's treatise on obligations. I have used a hitherto unpublished edition of the text (based on 14 manuscripts) made by Prof. E.J. Ashworth. I first give a brief description of Strode's text, which is all the more necessary given that it is not available to the average reader; I also offer a reconstruction of the rules proposed by Strode, following the style of reconstruction used in my analysis of Burley's and Swyneshed's rules elsewhere—that is, (...) essentially based on the idea that obligationes can be viewed as logical games. In the second part, I address Strode's explicit arguments contra Swyneshed. In the third part, I discuss Strode's epistemic and pragmatic approach to obligationes. (shrink)

About twenty-five years ago, Charles Parsons published a paper that began by asking why we still discuss the Liar Paradox. Today, the question seems all the more apt. In the ensuing years we have seen not only Parsons’ work (1974), but seminal work of Saul Kripke (1975), and a huge number of other important papers. Too many to list. Surely, one of them must have solved it! In a way, most of them have. Most papers on the Liar Paradox offer (...) some explanation of the behavior of paradoxical sentences, and most also offer some extension for the predicate ‘true’ that they think is adequate, at least in some restricted setting. But if this is a solution, then the problem we face is far from a lack of solutions; rather, we have an overabundance of conflicting ones. Kripke’s work alone provides us with uncountably many different extensions for the truth predicate. Even if it so happens that one of these is a conclusive solution, we do not seem to know which one, or why. We should also ask, given that we are faced with many technically elegant but contradictory views, if they are really all addressing the same problem. What we lack is not solutions, but a way to compare and evaluate the many ones we have. (shrink)

A formal theory of truth, alternative to tarski's 'orthodox' theory, based on truth-value gaps, is presented. the theory is proposed as a fairly plausible model for natural language and as one which allows rigorous definitions to be given for various intuitive concepts, such as those of 'grounded' and 'paradoxical' sentences.

It is argued that Yablo’s Paradox is not strictly paradoxical, but rather ‘ω-paradoxical’. Under a natural formalization, the list of Yablo sentences may be constructed using a diagonalization argument and can be shown to be ω-inconsistent, but nonetheless consistent. The derivation of an inconsistency requires a uniform fixed-point construction. Moreover, the truth-theoretic disquotational principle required is also uniform, rather than the local disquotational T-scheme. The theory with the local disquotation T-scheme applied to individual sentences from the Yablo list is also (...) consistent. (shrink)

If we try to evaluate the sentence on line 1 we ¯nd ourselves going in an unending cycle. For this reason alone we may conclude that the sentence is not true. Moreover we are driven to this conclusion by an elementary argument: If the sentence is true then what it asserts is true, but what it asserts is that the sentence on line 1 is not true. Consequently the sentence on line 1 is not true. But when we write this (...) true conclusion on line 2 we ¯nd ourselves repeating the very same sentence. It seems that we are unable to deny the truth of the sentence on line 1 without asserting it at the same time. (shrink)

The paper shows how we can add a truth predicate to arithmetic (or formalized syntactic theory), and keep the usual truth schema Tr( ) ↔ A (understood as the conjunction of Tr( ) → A and A → Tr( )). We also keep the full intersubstitutivity of Tr(>A>)) with A in all contexts, even inside of an →. Keeping these things requires a weakening of classical logic; I suggest a logic based on the strong Kleene truth tables, but with → (...) as an additional connective, and where the effect of classical logic is preserved in the arithmetic or formal syntax itself. Section 1 is an introduction to the problem and some of the difficulties that must be faced, in particular as to the logic of the →; Section 2 gives a construction of an arithmetically standard model of a truth theory; Section 3 investigates the logical laws that result from this; and Section 4 provides some philosophical commentary. (shrink)

The paper offers a solution to the semantic paradoxes, one in which (1) we keep the unrestricted truth schema “True(A)↔A”, and (2) the object language can include its own metalanguage. Because of the first feature, classical logic must be restricted, but full classical reasoning applies in “ordinary” contexts, including standard set theory. The more general logic that replaces classical logic includes a principle of substitutivity of equivalents, which with the truth schema leads to the general intersubstitutivity of True(A) with A (...) within the language.The logic is also shown to have the resources required to represent the way in which sentences (like the Liar sentence and the Curry sentence) that lead to paradox in classical logic are “defective”. We can in fact define a hierarchy of “defectiveness” predicates within the language. Contrary to claims that any solution to the paradoxes just breeds further paradoxes (“revenge problems”) involving defectiveness predicates, there is a general consistency/conservativeness proof that shows that talk of truth and the various “levels of defectiveness” can all be made coherent together within a single object language. (shrink)

I examine the theory of consequentia of the medieval logician, John Buridan. Buridan advocates a strict commitment to what we now call proposition-tokens as the bearers of truth-value. The analysis of Buridan's theory shows that, within a token-based semantics, amendments to the usual notions of inference and consequence are made necessary, since pragmatic elements disrupt the semantic behaviour of propositions. In my reconstruction of Buridan's theory, I use some of the apparatus of modern two-dimensional semantics, such as two-dimensional matrices and (...) the distinction between the context of formation and the context of evaluation of utterances. (shrink)

In this paper, I consider the question of whether or not the deflationist about truth can respond to the Liar and allied paradoxes by taking sentences such as the following: (1) (1) is false (2) (2) is not true (3) (3) is true to be meaningless. Let's call this strategy for dealing with the Liar and Liar-like phenomena the Meaningless Strategy. This strategy is intuitively satisfying: it captures many people's initial response to the paradoxes; and it is theoretically important: if (...) successful, it might allow the deflationist to avoid the revenge problem that plagues so many putative solutions to the Liar. Moreover, owing to the austerity of their theory, deflationists have very few resources to deploy in attempting to accommodate the Liar, which means that if the deflationist is in a good position to employ the Meaningless Strategy, so much the better for deflationism. (shrink)

The general verificationist thesis says that What is true can be known or formally: φ → ◊Kφ VT Fitch's argument trivializes this principle. It uses a weak modal epistemic logic to show that VT collapses truth and knowledge, by taking a clever substitution instance for φ: P ∧ ¬KP → ◊ K(P ∧ ¬KP) Then we have the following chain of three conditionals (a) ◊ K(P ∧ ¬KP) → ◊ (KP ∧ K¬KP) in the minimal modal logic for the knowledge (...) operator K, (b) ◊ (KP ∧ K¬KP) → ◊ (KP ∧¬KP) in the modal logic T, and finally (c) ◊ (KP ∧¬KP) → ⊥ in the minimal modal logic for. (shrink)

Mental language, According to ockham, Consists of mental acts or capacities for performing mental acts. Its structure is analogous to that of spoken or written language and is the structure of a logically ideal language. Hence its study is useful for philosophy. Ockham's concern about the apparent closeness of the analogy is also considered with reference to his discussion of the possibility of angelic (and hence nonphysical) language.

The ?no???no? paradox (so-called by Sorensen) consists of a pair of propositions each of which says of the other that it is false. It is not immediately paradoxical, since it has a solution in which one proposition is true, the other false. However, that is itself paradoxical, since there is no clear ground for determining which is which. The two propositions should have the same truth-value. The paper shows how a proposal by the medieval thinker Thomas Bradwardine solves not only (...) the Liar paradox, but also symmetric paradoxes like the ?no???no?, the descending ?no???no?, and the Truth-teller paradoxes. (shrink)

A textual and philosophical study of the claim that according to ockham there is no synonymy or equivocation in mental language. It is argued that ockham is committed to both claims, Either explicitly or in virtue of other features of his doctrine. Nevertheless, Both claims lead to difficulties for ockham's theory.

A view often expressed is that to classify the liar sentence as neither true nor false is satisfactory for the simple liar but not for the strengthened liar. I argue that in fact it is equally unsatisfactory for both liars. I go on to discuss whether, nevertheless, Kripke''s theory of truth represents an advance on that of Tarski.

I argue that the medieval form of dialectical disputation known as obligationes can be viewed as a logical game of consistency maintenance. The game has two participants, Opponent and Respondent. Opponent puts forward a proposition P; Respondent must concede, deny or doubt, on the basis of inferential relations between P and previously accepted or denied propositions, or, in case there is none, on the basis of the common set of beliefs. Respondent loses the game if he concedes a contradictory set (...) of propositions. Opponent loses the game if Respondent is able to maintain consistency during the stipulated period of time. The obligational rules are here formalised by means of familiar notational devices, and the application of some game-theoretical concepts, such as (winning) strategy, moves, motivation, allows for an analysis of some crucial properties of the game. In particular, the primacy of inferential (syntactic) relations over semantic aspects and the dynamic character of obligations are outlined. (shrink)