Online research in philosophy

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.

Bringing together powerful new tools from set theory and the philosophy of language, this book proposes a solution to one of the few unresolved paradoxes from antiquity, the Paradox of the Liar. Treating truth as a property of propositions, not sentences, the authors model two distinct conceptions of propositions: one based on the standard notion used by Bertrand Russell, among others, and the other based on J.L. Austin's work on truth. Comparing these two accounts, the authors show that while the Russellian conception of the relation between sentences, propositions, and truth is crucially flawed in limiting cases, the Austinian perspective has fruitful applications to the analysis of semantic paradox. In the course of their study of a language admitting circular reference and containing its own truth predicate, Barwise and Etchemendy also develop a wide range of model-theoretic techniques--based on a new set-theoretic tool, Peter Aczel's theory of hypersets--that open up new avenues in logical and formal semantics.

A many-valued (aka multiple- or multi-valued) semantics, in the strict sense, is one which employs more than two truth values; in the loose sense it is one which countenances more than two truth statuses. So if, for example, we say that there are only two truth values—True and False—but allow that as well as possessing the value True and possessing the value False, propositions may also have a third truth status—possessing neither truth value—then we have a many-valued semantics in the loose but not the strict sense. A many-valued logic is one which arises from a many-valued semantics and does not also arise from any two-valued semantics [Malinowski, 1993, 30]. By a ‘logic’ here we mean either a set of tautologies, or a consequence relation. We can best explain these ideas by considering the case of classical propositional logic. The language contains the usual basic symbols (propositional constants p, q, r, . . .; connectives ¬, ∧, ∨, →, ↔; and parentheses) and well-formed formulas are defined in the standard way. With the language thus specified—as a set of well-formed formulas—its semantics is then given in three parts. (i) A model of a logical language consists in a free assignment of semantic values to basic items of the non-logical vocabulary. Here the basic items of the non-logical vocabulary are the propositional constants. The appropriate kind of semantic value for a proposition is a truth value, and so a model of the language consists in a free assignment of truth values to basic propositions. Two truth values are countenanced: 1 (representing truth) and 0 (representing falsity). (ii) Rules are presented which determine a truth value for every proposition of the language, given a model. The most common way of presenting these rules is via truth tables (Figure 1). Another way of stating such rules—which will be useful below—is first to introduce functions on the truth values themselves: a unary function ¬ and four binary functions ∧, ∨, → and ↔ (Figure 2)..

We develop a framework for natural language semantics which handles intensionality via metalogical constructions and deals with degree truth values in an integrated way. We take an axiomatic set theory, ZF, as the foundation for semantic representations, but we make ZF a metalanguage for part of itself by embedding a language ℒ within ZF which is basically a copy of the part of ZF consisting of set expressions. This metalogical set-up is used for handling propositional attitude verbs (limited to believe in this paper). We define a truth function τ which determines the truth value τ(p, T) of an ℒ-proposition p with respect to a theory T. Theories are sets of ℒ-propositions with associated truth values, and can be viewed as a (much more well-defined) replacement for possible worlds. We develop a mechanism for defining belief worlds as theories. We simultaneously develop two different versions of our system - a Boolean version where the set Ω of truth values is {0, 1}, and a degree-truth version where Ω is the interval [0, 1] of real numbers. We use degrees of truth in handling a broad class of semantic predicates that we call base-focus predicates, which include generalized quantifiers as well as many adverb and adjective senses and certain discourse-level predicates.

I present an account of truth values for classical logic, intuitionistic logic, and the modal logic s5, in which truth values are not a fundamental category from which the logic is defined, but rather, an idealisation of more fundamental logical features in the proof theory for each system. The result is not a new set of semantic structures, but a new understanding of how the existing semantic structures may be understood in terms of a more fundamental notion of logical consequence.

Thinking about truth can be more dangerous than it looks. Of course, our concept of truth is the source of one of the most frustrating and impenetrable paradoxes humans have ever contemplated, the liar paradox, but that is just the beginning of its treachery. In an effort to understand why one of the most beloved and revered members of our conceptual repertoire could cause us so much trouble, philosophers have for centuries proposed “solutions” to the liar paradox. However, it seems that our concept of truth takes offense to our efforts to understand it because it appears to retaliate against those who propose “solutions” to the liar. It takes its revenge on us by creating new paradoxes from our own attempts to find resolution. That is, most proposed solutions to the liar paradox give rise to new, more insidious paradoxes—often called revenge paradoxes. For our attempts at understanding, truth rewards us with inconsistent theories, untenable logics, and a deep feeling of bewilderment. It is as if our concept of truth lashes out at us because it wants to remain a mystery. After a few run-ins with truth, many philosophers have the good sense to keep their distance. Far from being the serene, profound concept most people take it to be, those of us who think much about the liar paradox know truth to be a vengeful bully—a conceptual misanthrope.

An analogy between functional dependencies and implicational formulas of sentential logic has been discussed in the literature. We feel that a somewhat different connexion between dependency theory and sentential logic is suggested by the similarity between Armstrong's axioms for functional dependencies and Tarski's defining conditions for consequence relations, and we pursue aspects of this other analogy here for their theoretical interest. The analogy suggests, for example, a different semantic interpretation of consequence relations: instead of thinking ofB as a consequence of a set of formulas {A1,...,A n} whenB is true on every assignment of truth-values on which eachA i is true, we can think of this relation as obtaining when every pair of truth-value assignments which give the same truth-values toA 1, the same truth-values toA 2,..., and the same truth-values toA n, also make the same assignment in respect ofB. We describe the former as the consequence relation inference-determined by the class of truth-value assignments (valuations) under consideration, and the latter as the consequence relation supervenience-determined by that class of assignments. Some comparisons will be made between these two notions.

In Philosophical Logic, the Liar Paradox has been used to motivate the introduction of both truth value gaps and truth value gluts. Moreover, in the light of “revenge Liar” arguments, also higher-order combinations of generalized truth values have been suggested to account for so-called hyper-contradictions. In the present paper, Graham Priest's treatment of generalized truth values is scrutinized and compared with another strategy of generalizing the set of classical truth values and defining an entailment relation on the resulting sets of higher-order values. This method is based on the concept of a multilattice. If the method is applied to the set of truth values of Belnap's “useful four-valued logic”, one obtains a trilattice, and, more generally, structures here called Belnap-trilattices. As in Priest's case, it is shown that the generalized truth values motivated by hyper-contradictions have no effect on the logic. Whereas Priest's construction in terms of designated truth values always results in his Logic of Paradox, the present construction in terms of truth and falsity orderings always results in First Degree Entailment. However, it is observed that applying the multilattice-approach to Priest's initial set of truth values leads to an interesting algebraic structure of a “bi-and-a-half” lattice which determines seven-valued logics different from Priest's Logic of Paradox.

Tarski avoids the liar paradox by relativizing truth and falsehood to particular languages and forbidding the predication to sentences in a language of truth or falsehood by any sentences belonging to the same language. The Tarski truth-schemata stratify an object-language and indefinitely ascending hierarchy of meta-languages in which the truth or falsehood of sentences in a language can only be asserted or denied in a higher-order meta-language. However, Tarski’s statement of the truth-schemata themselves involve general truth functions, and in particular the biconditional, defined in terms of truth conditions involving truth values standardly displayed in a truth table. Consistently with his semantic program, all such truth values should also be relativized to particular languages for Tarski. The objection thus points toward the more interesting problem of Tarski’s concept of the exact status of truth predications in a general logic of sentential connectives. Tarski’s three-part solution to the circularity objection which he anticipates is discussed and refuted in detail.

The No-No Paradox consists of a pair of statements, each of which ?says? the other is false. Roy Sorensen claims that the No-No Paradox provides an example of a true statement that has no truthmaker: Given the relevant instances of the T-schema, one of the two statements comprising the ?paradox? must be true (and the other false), but symmetry constraints prevent us from determining which, and thus prevent there being a truthmaker grounding the relevant assignment of truth values. Sorensen's view is mistaken: situated within an appropriate background theory of truth, the statements comprising the No-No Paradox are genuinely paradoxical in the same sense as is the Liar (and thus, on Sorensen's view, must fail to have truth values). This result has consequences beyond Sorensen's semantic framework. In particular, the No-No Paradox, properly understood, is not only a new paradox, but also provides us with a new type of paradox, one which depends upon a general background theory of the truth predicate in a way that the Liar Paradox and similar constructions do not.