The Liar Paradox and the Inclosure Schema

In Beyond the Limits of Thought [2002], Graham Priest argues that logical and semantic paradoxes have the same underlying structure (which he calls the Inclosure Schema). He also argues that, in conjunction with the Principle of Uniform Solution (same kind of paradox, same kind of solution), this is sufficient to ‘sink virtually all orthodox solutions to the paradoxes’, because the orthodox solutions to the paradoxes are not uniform. I argue that Priest fails to provide a non-question-begging method to ‘sink virtually all orthodox solutions’, and that the Inclosure Schema cannot be the structure that underlies the Liar paradox. Moreover, Ramsey was right in thinking that logical and semantic paradoxes are paradoxes of different kinds.     

Definition Inclosed: A Reply to Zhong

In ‘Definability and the Structure of Logical Paradoxes’ (Australasian Journal of Philosophy, this issue) Haixia Zhong takes issue with an account of the paradoxes of self-reference to be found in Beyond the Limits of Thought [Priest 1995. The point of this note is to explain why the critique does not succeed. The criterion for distinguishing between the set-theoretic and the semantic paradoxes offered does not get the division right; the semantic paradoxes are not given a uniform solution; no reason is provided as to why the naïve denotation relation is ‘indefinite’ (other than that its definiteness leads to contradiction); and the account of the denotation relation given clearly misses the mark, even by consistent standards.     

What the Liar Taught Achilles

Zeno's paradoxes of motion and the semantic paradoxes of the Liar have long been thought to have metaphorical affinities. There are, in fact, isomorphisms between variations of Zeno's paradoxes and variations of the Liar paradox in infinite-valued logic. Representing these paradoxes in dynamical systems theory reveals fractal images and provides other geometric ways of visualizing and conceptualizing the paradoxes.     

No Justificatory Closure without Truth

It is well-known that versions of the lottery paradox and of the preface paradox show that the following three principles are jointly inconsistent: (Sufficiency) very probable propositions are justifiably believable; (Conjunction Closure) justified believability is closed under conjunction introduction; (No Contradictions) propositions known to be contradictory are not justifiably believable. This paper shows that there is a hybrid of the lottery and preface paradoxes that does not require Sufficiency to arise, but only Conjunction Closure and No Contradictions; and it argues that, given any plausible solution to this paradox, if one is not ready to deny Conjunction Closure (and analogous consistency principles), then one must endorse the thesis that justified believability is factive.     

No Future

The difficulties with formalizing the intensional notions necessity, knowability and omniscience, and rational belief are well-known. If these notions are formalized as predicates applying to (codes of) sentences, then from apparently weak and uncontroversial logical principles governing these notions, outright contradictions can be derived. Tense logic is one of the best understood and most extensively developed branches of intensional logic. In tense logic, the temporal notions future and past are formalized as sentential operators rather than as predicates. The question therefore arises whether the notions that are investigated in tense logic can be consistently formalized as predicates. In this paper it is shown that the answer to this question is negative. The logical treatment of the notions of future and past as predicates gives rise to paradoxes due the specific interplay between both notions. For this reason, the tense paradoxes that will be presented are not identical to the paradoxes referred to above.     

Antonyms and Paradoxes

Adjectives can be gradable or non-gradable and this aspect of their meaning is responsible for their different distribution and also for their classification into two different classes of antonyms. Non-gradable antonyms are called contradictories: they are neither true nor false together and exclude any middle term; gradable antonyms are called contraries: they are not simultaneously true, but may be simultaneously false. While with contraries a negative disjunction (neque...neque) can define an intermediate level, with contradictories it simply means that either term of the disjunction is excluded. There are however some Latin examples, such as neque vivus neque mortuus (`neither alive nor dead'), where the negation of a contradictory pair is used to convey a third, intermediate value. This third possibility is precisely what gives place to a paradox. Such an intermediate level can be defined also by terms like semivivus, semianimis (`half-dead'). Following Ducrot's theory on argumentation, such terms represent an argumentative attenuation, not with respect to life, rather with respect to death. With contradictories, in fact, the use of semi-, like the use of negation, gives the assertion of the opposite term as a result.     

How to eliminate self-reference: a précis

We provide a systematic recipe for eliminating self-reference from a simple language in which semantic paradoxes (whether purely logical or empirical) can be expressed. We start from a non-quantificational language L which contains a truth predicate and sentence names, and we associate to each sentence F of L an infinite series of translations h ₀(F), h ₁(F), ..., stated in a quantificational language L ^*. Under certain conditions, we show that none of the translations is self-referential, but that any one of them perfectly mirrors the semantic behavior of the original. The result, which can be seen as a generalization of recent work by Yablo (1993, Analysis, 53, 251–252; 2004, Self-reference, CSLI) and Cook (2004, Journal of Symbolic Logic, 69(3), 767–774), shows that under certain conditions self-reference is not essential to any of the semantic phenomena that can be obtained in a simple language.     

The Elimination of Self-Reference: Generalized Yablo-Series and the Theory of Truth

Although it was traditionally thought that self-reference is a crucial ingredient of semantic paradoxes, Yablo (1993, 2004) showed that this was not so by displaying an infinite series of sentences none of which is self-referential but which, taken together, are paradoxical. Yablo’s paradox consists of a countable series of linearly ordered sentences s(0), s(1), s(2),... , where each s(i) says: For each k > i, s(k) is false (or equivalently: For no k > i is s(k) true). We generalize Yablo’s results along two dimensions. First, we study the behavior of generalized Yablo-series in which each sentence s(i) has the form: For Q k > i, s(k) is true, where Q is a generalized quantifier (e.g., no, every, infinitely many, etc). We show that under broad conditions all the sentences in the series must have the same truth value, and we derive a characterization of those values of Q for which the series is paradoxical. Second, we show that in the Strong Kleene trivalent logic Yablo’s results are a special case of a more general fact: under certain conditions, any semantic phenomenon that involves self-reference can be emulated without self-reference. Various translation procedures that eliminate self-reference from a non-quantificational language are defined and characterized. An Appendix sketches an extension to quantificational languages, as well as a new argument that Yablo’s paradox and the translations we offer do not involve self-reference.     

Theism and Dialetheism

The divine attributes of omniscience and omnipotence have faced objections to their very consistency. Such objections rely on reasoning parallel to semantic paradoxes such as the Liar or to set-theoretic paradoxes like Russell's paradox. With the advent of paraconsistent logics, dialetheism—the view that some contradictions are true—became a major player in the search for a solution to such paradoxes. This paper explores whether dialetheism, armed with the tools of paraconsistent logics, has the resources to respond to the objections levelled against the divine attributes.     

Beltrami's model and the independence of the parallel postulate

In their correspondence in 1902 and 1903, after discussing the Russell paradox, Russell and Frege discussed the paradox of propositions considered informally in Appendix B of Russell's Principles of Mathematics. It seems that the proposition, p, stating the logical product of the class w, namely, the class of all propositions stating the logical product of a class they are not in, is in w if and only if it is not. Frege believed that this paradox was avoided within his philosophy due to his distinction between sense (Sinn) and reference (Bedeutung). However, I show that while the paradox as Russell formulates it is ill-formed with Frege's extant logical system, if Frege's system is expanded to contain the commitments of his philosophy of language, an analogue of this paradox is formulable. This and other concerns in Fregean intensional logic are discussed, and it is discovered that Frege's logical system, even without its naive class theory embodied in its infamous Basic Law V, leads to inconsistencies when the theory of sense and reference is axiomatized therin. therein.     

The Bricot–Mair Dispute: Scholastic Prolegomena to Non-Compositional Semantics

From a general semantic point of view, Thomas Bricot (d. 1516) and John Mair (1467–1550) are proponents of the solution to semantic paradoxes based on appreciation of the contextuality of truth, who differ in their approach to the relations of logical consequence and contradiction. The core of the study is the analysis of Mair's criticism of Bricot presented in the sixth quaestio of his Tractatus insolubilium where the consequences of non-compositional semantics for the concepts of synonymy and logical form are addressed. The polemic between John Mair and Thomas Bricot is construed as having immediate consequences for research in the area of non-compositional semantics.     

A Revenge-Immune Solution to the Semantic Paradoxes

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.     

A neglected response to the paradoxes of confirmation

Hempel's paradox of the ravens, and his take on it, are meant to be understood as being restricted to situations where we have no additional background information. According to him, in the absence of any such information, observations of FGs confirm the hypothesis that all Fs are G. In this paper I argue against this principle by way of considering two other paradoxes of confirmation, Goodman’s “grue” paradox and the “tacking” (or “irrelevant conjunct”) paradox. What these paradoxes reveal, I argue, is that a presumption of causal realism is required to ground any confirmation; but once we grant causal realism, we have no reason to accept the central principles giving rise to the paradoxes.     

Definability and the Structure of Logical Paradoxes

Graham Priest 2002 argues that all logical paradoxes that include set-theoretic paradoxes and semantic paradoxes share a common structure, the Inclosure Schema, so they should be treated as one family. Through a discussion of Berry's Paradox and the semantic notion ‘definable’, I argue that (i) the Inclosure Schema is not fine-grained enough to capture the essential features of semantic paradoxes, and (ii) the traditional separation of the two groups of logical paradoxes should be retained.     

Chrysippus Confronts the Liar: The Case for Stoic Cassationism

The Stoic philosopher Chrysippus wrote extensively on the liar paradox, but unfortunately the extant testimony on his response to the paradox is meager and mainly hostile. Modern scholars, beginning with Alexander Rüstow in the first decade of the twentieth century, have attempted to reconstruct Chrysippus’ solution. Rüstow argued that Chrysippus advanced a cassationist solution, that is, one in which sentences such as ‘I am speaking falsely’ do not express propositions. Two more recent scholars, Walter Cavini and Mario Mignucci, have rejected Rüstow's thesis that Chrysippus used a cassationist approach. Each has proposed his own thesis about Chrysippus’ solution. I argue that Rüstow's view is fundamentally correct, and that the cassationist thesis gains greater plausibility when viewed in light of a passage in Sextus Empiricus’ Adversus mathematicos that the previous commentators have ignored, and when understood within the broader context of Stoic logical theory and philosophy of language. I close with a brief remark on the significance of Chrysippus’ work for the modern debate on the semantic paradoxes.     

Stability and Paradox in Algorithmic Logic

There is significant interest in type-free systems that allow flexible self-application. Such systems are of interest in property theory, natural language semantics, the theory of truth, theoretical computer science, the theory of classes, and category theory. While there are a variety of proposed type-free systems, there is a particularly natural type-free system that we believe is prototypical: the logic of recursive algorithms. Algorithmic logic is the study of basic statements concerning algorithms and the algorithmic rules of inference between such statements. As shown in [1], the threat of paradoxes, such as the Curry paradox, requires care in implementing rules of inference in this context. As in any type-free logic, some traditional rules will fail. The first part of the paper develops a rich collection of inference rules that do not lead to paradox. The second part identifies traditional rules of logic that are paradoxical in algorithmic logic, and so should be viewed with suspicion in type-free logic generally.     

Against Stepping Back: A Critique of Contextualist Approaches to the Semantic Paradoxes

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.     

Paradoxes of happiness

To get happiness forget about it; then, with any luck, happiness will come as a by-product in pursuing meaningful activities and relationships. This adage is known as the paradox of happiness, but actually it contains a number of different paradoxes concerning aims, success, freedom, and attitudes. These paradoxes enhance our understanding of the complexity of happiness and its interaction with other values in good lives, that is, lives which are happy as well as morally decent, meaningful, and fulfilling. Yet, each paradox conveys a one-sided truth that needs to be balanced with others. Happiness, understood as subjective well-being, involves positively evaluating our lives and living with a sense of well-being. As such, it should not be confused with either pleasure or normative conceptions of “true” happiness.     

Non‐Classical Knowledge

The Knower paradox purports to place surprising a priori limitations on what we can know. According to orthodoxy, it shows that we need to abandon one of three plausible and widely‐held ideas: that knowledge is factive, that we can know that knowledge is factive, and that we can use logical/mathematical reasoning to extend our knowledge via very weak single‐premise closure principles. I argue that classical logic, not any of these epistemic principles, is the culprit. I develop a consistent theory validating all these principles by combining Hartry Field's theory of truth with a modal enrichment developed for a different purpose by Michael Caie. The only casualty is classical logic: the theory avoids paradox by using a weaker‐than‐classical K₃ logic. I then assess the philosophical merits of this approach. I argue that, unlike the traditional semantic paradoxes involving extensional notions like truth, its plausibility depends on the way in which sentences are referred to—whether in natural languages via direct sentential reference, or in mathematical theories via indirect sentential reference by Gödel coding. In particular, I argue that from the perspective of natural language, my non‐classical treatment of knowledge as a predicate is plausible, while from the perspective of mathematical theories, its plausibility depends on unresolved questions about the limits of our idealized deductive capacities.