Off-campus access
Using PhilPapers from home?
Click here to configure this browser for off-campus access.
- J. A. Burgess (1997). Supervaluations and the Propositional Attitude Constraint. Journal of Philosophical Logic 26 (1):103-119.For the sentences of languages that contain operators that express the concepts of definiteness and indefiniteness, there is an unavoidable tension between a truth-theoretic semantics that delivers truth conditions for those sentences that capture their propositional contents and any model-theoretic semantics that has a story to tell about how indetifiniteness in a constituent affects the semantic value of sentences which imbed it. But semantic theories of both kinds play essential roles, so the tension needs to be resolved. I argue that it is the truth theory which correctly characterises the notion of truth, per se. When we take into account the considerations required to bring model theory into harmony with truth theory, those considerations undermine the arguments standardly used to motivate supervaluational model theories designed to validate classical logic. But those considerations also show that celebration would be premature for advocates of the most frequently encountered rival approach – many-valued model theory.
Similar books and articles
The first section (§1) of this essay defends reliance on truth values against those who, on nominalistic grounds, would uniformly substitute a truth predicate. I rehearse some practical, Carnapian advantages of working with truth values in logic. In the second section (§2), after introducing the key idea of auxiliary parameters (§2.1), I look at several cases in which logics involve, as part of their semantics, an extra auxiliary parameter to which truth is relativized, a parameter that caters to special kinds of sentences. In many cases, this facility is said to produce truth values for sentences that on the face of it seem neither true nor false. Often enough, in this situation appeal is made to the method of supervaluations, which operate by “quantifying out” auxiliary parameters, and thereby produce something like a truth value. Logics of this kind exhibit striking differences. I first consider the role that Tarski gives to supervaluation in first order logic (§2.2), and then, after an interlude that asks whether neither-true-nor-false is itself a truth value (§2.3), I consider sentences with non-denoting terms (§2.4), vague sentences (§2.5), ambiguous sentences (§2.6), paradoxical sentences (§2.7), and future-tensed sentences in indeterministic tense logic (§2.8). I conclude my survey with a look at alethic modal logic considered as a cousin (§2.9), and finish with a few sentences of “advice to supervaluationists” (2.10), advice that is largely negative. The case for supervaluations as a road to truth is strong only when the auxiliary parameter that is “quantified out” is in fact irrelevant to the sentences of interest—as in Tarski’s definition of truth for classical logic. In all other cases, the best policy when reporting the results of supervaluation is to use only explicit phrases such as “settled true” or “determinately true,” never dropping the qualification.
The essence of the meaning of a declarative sentence is given by stating its truth conditions, and consequently semantics, the study of meaning, must include a theory of truth conditions. Such a theory must not only describe accurately the truth conditions of declarative sentences, it must also answer the question of when two sentences have the same truth conditions. The fundamental semantic relation of having the same truth conditions cannot be ignored by any reasonable theory.This paper is an attempt to find a partial account of this relation by using game theoretical semantics as developed by Hintikka and his followers. The account given will establish a connection between this approach to semantics and the theory of firstdegree entailment formulated by Anderson and Belnap.
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)..
A hallmark of correspondence theories of truth is the principle that sentences are made true by some truth-makers. A well-known objection to treating Tarski’s definition of truth as a correspondence theory has been put forward by Donald Davidson. He argued that Tarski’s approach does not relate sentences to any entities (like facts) to which true sentences might correspond.
From the historical viewpoint, it is interesting to observe that Tarski’s philosophical teacher Tadeusz Kotarbinski advocated an ontological doctrine of reism which accepted only concrete individuals and rejected all such abstract entities as facts, states of affairs, properties, and sets.
Kotarbinski’s physicalism influenced Tarski who also avoided concepts like “fact” and “property” in his theory of truth, but—unlike Kotarbinski—he used freely set-theoretical terminology. In his mature work in model theory in the 1950s, Tarski used systematically the notion of a relational system (i.e., a domain of objects with designated elements, subsets, and relations).
Wilfrid Hodges has argued that the notions of “structure” and “truth in a structure” appeared in Tarski’s work only in 1950. In my view, one can find the main ingredients of the model-theoretic account of truth already in the 1930s. These considerations suggest, against Davidson, that Tarski’s definition presupposes that material truth is always related to some kind of truth-maker. Further, facts as truth-makers can be reconstructed by employing the resources of model theory.
Propositional attitude ascribing sentences seem to give rise to failures of substitution. Is this phenomena best accounted for semantically, by constructing a semantics for propositional attitude ascribing sentences that invalidates the Substitution Principle, or pragmatically? In this paper I argue against semantic accounts of such phenomena. I argue that any semantic theory that respects all our apparent substitution failure intuitions will entail that the noun-phrase position outside the scope of the attitude verb is not open to substitution salva veritate, which is counter-intuitive.
The model-theoretic analysis of the concept of logical consequence has come under heavy criticism in the last couple of decades. The present work looks at an alternative approach to logical consequence where the notion of inference takes center stage. Formally, the model-theoretic framework is exchanged for a proof-theoretic framework. It is argued that contrary to the traditional view, proof-theoretic semantics is not revisionary, and should rather be seen as a formal semantics that can supplement model-theory. Specifically, there are formal resources to provide a proof-theoretic semantics for both intuitionistic and classical logic. We develop a new perspective on proof-theoretic harmony for logical constants which incorporates elements from the substructural era of proof-theory. We show that there is a semantic lacuna in the traditional accounts of harmony. A new theory of how inference rules determine the semantic content of logical constants is developed. The theory weds proof-theoretic and model-theoretic semantics by showing how proof-theoretic rules can induce truth-conditional clauses in Boolean and many-valued settings. It is argued that such a new approach to how rules determine meaning will ultimately assist our understanding of the apriori nature of logic.
The partial structures approach has two major components: a broad notion of structure (partial structure) and a weak notion of truth (quasi-truth). In this paper, we discuss the relationship between this approach and free logic. We also compare the model-theoretic analysis supplied by partial structures with the method of supervaluations, which was initially introduced as a technique to provide a semantic analysis of free logic. We then combine the three formal frameworks (partial structures, free logic and supervaluations), and apply the resulting approach to accommodate semantic paradoxes.
The partial structures approach has two major components: a broad notion of structure (partial structure) and a weak notion of truth (quasi-truth). In this paper, we discuss the relationship between this approach and free logic. We also compare the model-theoretic analysis supplied by partial structures with the method of supervaluations, which was initially introduced as a technique to provide a semantic analysis of free logic. We then combine the three formal frameworks (partial structures, free logic and supervaluations), and apply the resulting approach to accommodate semantic paradoxes.
Two naturalistic explications of propositional attitudes and their contents are distinguished: the language of thought based theory, on which beliefs are relations to sentences in the language of thought; and the propositional attitude based theory, on which beliefs are functional states of a functional system that does not imply a language of thought, although consistent with it. The latter theory depends on interpersonally ascribable conceptual roles; if these are not available, the language of thought theory has the advantage. But the propositional attitude based theory explains intentionality and conceptual structure as well as the language of thought based theory, and it has two further advantages. First, it does not make the existence of beliefs and desires depend on the language of thought hypothesis. Secondly, its employment of interpersonally ascribable conceptual roles permits a theory of truth conditions to meet certain desiderata, such as a social basis for truth conditions, and a realist conception of truth.
No semantic theory satisfying certain natural constraints can identify the semantic contents of sentences (the propositions they express), with sets of circumstances in which the sentences are true–no matter how fine-grained the circumstances are taken to be. An objection to the proof is shown to fail by virtue of conflating model-theoretic consequence between sentences with truth-conditional consequence between the semantic contents of sentences. The error underlines the impotence of distinguishing semantics, in the sense of a truth-based theory of logical consequence, and semantics, in the sense of a theory of meaning.
Discussion of J. A. Burgess, Supervaluations and the propositional attitude constraint
|
|
There are no threads in this forum |
Nothing in this forum yet.

