Semantic Information and the Syntax of Propositional Attitude Verbs

Propositional attitude verbs, such as think and want, have long held interest for both theoretical linguists and language acquisitionists because their syntactic, semantic, and pragmatic properties display complex interactions that have proven difficult to fully capture from either perspective. This paper explores the granularity with which these verbs’ semantic and pragmatic properties are recoverable from their syntactic distributions, using three behavioral experiments aimed at explicitly quantifying the relationship between these two sets of properties. Experiment 1 gathers a measure of 30 propositional attitude verbs’ syntactic distributions using an acceptability judgment task. Experiments 2a and 2b gather measures of semantic similarity between those same verbs using a generalized semantic discrimination (triad or “odd man out”) task and an ordinal (Likert) scale task, respectively. Two kinds of analyses are conducted on the data from these experiments. The first compares both the acceptability judgments and the semantic similarity judgments to previous classifications derived from the syntax and semantics literature. The second kind compares the acceptability judgments to the semantic similarity judgments directly. Through these comparisons, we show that there is quite fine‐grained information about propositional attitude verbs’ semantics carried in their syntactic distributions—whether one considers the sorts of discrete qualitative classifications that linguists traditionally work with or the sorts of continuous quantitative classifications that can be derived experimentally.     

Supervaluations and the Problem of the Many

Supervaluational treatments of vagueness are currently quite popular among those who regard vagueness as a thoroughly semantic phenomenon. Peter Unger's 'problem of the many' may be regarded as arising from the vagueness of our ordinary physical-object terms, so it is not surprising that supervaluational solutions to Unger's problem have been offered. I argue that supervaluations do not afford an adequate solution to the problem of the many. Moreover, the considerations I raise against the supervaluational solution tell also against the solution to the problem of the many which is suggested by adherents of the epistemic theory of vagueness.     

Supervaluation-Style Truth Without Supervaluations

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.     

Quasi-Truth,Supervaluations and Free 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.     

Attitude,Inference, Association: On the Propositional Structure of Implicit Bias

The overwhelming majority of those who theorize about implicit biases posit that these biases are caused by some sort of association. However, what exactly this claim amounts to is rarely specified. In this paper, I distinguish between different understandings of association, and I argue that the crucial senses of association for elucidating implicit bias are the cognitive structure and mental process senses. A hypothesis is subsequently derived: if associations really underpin implicit biases, then implicit biases should be modulated by counterconditioning or extinction but should not be modulated by rational argumentation or logical interventions. This hypothesis is false; implicit biases are not predicated on any associative structures or associative processes but instead arise because of unconscious propositionally structured beliefs. I conclude by discussing how the case study of implicit bias illuminates problems with popular dual‐process models of cognitive architecture.     

Truth Values,Neither-true-nor-false,and Supervaluations

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.     

Author Correction: Supervaluation-Style Truth Without Supervaluations

Journal of Philosophical Logic - The original version of the article unfortunately contained a mistake. In the Acknowledgments section of the original version of the article, the grant number of...     

Propositional quantifiers

Summary In discussing propositional quantifiers we have considered two kinds of variables: variables occupying the argument places of connectives, and variables occupying the argument places of predicates.We began with languages which contained the first kind of variable, i.e., variables taking sentences as substituends. Our first point was that there appear to be no sentences in English that serve as adequate readings of formulas containing propositional quantifiers. Then we showed how a certain natural and illuminating extension of English by prosentences did provide perspicuous readings. The point of introducing prosentences was to provide a way of making clear the grammar of propositional variables: propositional variables have a prosentential character — not a pronominal character. Given this information we were able to show, on the assumption that the grammar of propositional variables in philosopher's English should be determined by their grammar in formal languages (unless a separate account of their grammar is provided), that propositional variables can be used in a grammatically and philosophically acceptable way in philosophers' English. According to our criteria of well-formedness Carnap's semantic definition of truth does not lack an essential predicate - despite arguments to the contrary. It also followed from our account of the prosentential character of bound propositional variables that in explaining propositional quantification, sentences should not be construed as names.One matter we have not discussed is whether such quantification should be called propositional, sentential, or something else. As our variables do not range over (they are not terms) either propositions, or sentences, each name is inappropriate, given the usual picture of quantification. But we think the relevant question in this context is, are we obtaining generality with respect to propositions, sentences, or something else?Because people have argued that all bound variables must have a pronominal character, we presented and discussed in the third section languages in which the variables take propositional terms as substituends. In our case we included names of propositions, that-clauses, and names of sentences in the set of propositional terms. We made a few comparisons with the languages discussed in the second section. We showed among other things how a truth predicate could be used to obtain generality. In contrast, the languages of the second section, using propositional variables, obtain generality without the use of a truth predicate.Special thanks are due to Nuel D. Belnap, Jr., who has given me much valuable assistance with the preparation of this paper. I also thank Alan Ross Anderson, Joseph Camp, Jr., Steven Davis, and Wilfrid Sellars for suggestions and corrections.The preparation of this paper was partly supported by a NSF grant.     

Propositional anaphors

Philosophical Studies - Propositions are posited to perform a variety of explanatory roles. One important role is being what is designated by a dedicated linguistic expression like a that-clause....     

Propositional Names

I propose that an adequate name for a proposition will be (1) rigid, in Kripke’s sense of referring to the same thing in every world in which it exists, and (2) transparent, which means that it would be possible, if one knows the name, to know which object the name refers. I then argue that the Standard Way of naming propositions—prefixing the word ‘that’ to a declarative sentence—does not allow for transparent names of every proposition, and that no alternative naming convention does better. I explore the implications of this failure for deflationism about truth, arguing that any theory that requires the T biconditional to be a priori cannot succeed.     

Propositional Q-Logic

Topic of the paper is Q-logic – a logic of agency in its temporal and modal context. Q-logic may be considered as a basal logic of agency since the most important stit-operators discussed in the literature can be defined or axiomatized easily within its semantical and syntactical framework. Its basic agent dependent operator, the Q-operator (also known as - or cstit-operator), which has been discussed independently by F. v. Kutschera and B. F. Chellas, is investigated here in respect of its relation to other temporal and modal operators. The main result of the paper, then, is a completeness result for a calculus of Q-logic with respect to a semantics defined on the tree-approach to agency as introduced and developed by, among others, F. v. Kutschera and N. D. Belnap.     

Propositional knowledge and know-how

This paper is roughly in two parts. The first deals with whether know-how is constituted by propositional knowledge, as discussed primarily by Gilbert Ryle (1949) The concept of mind. London: Hutchinson, Jason Stanley and Timothy Williamson (2001). Knowing how. Journal of Philosophy, 98, pp. 411–444 as well as Stephen Hetherington (2006). How to know that knowledge-that is knowledge-how. In S. Hetherington (Ed.) Epistemology futures. Oxford: Oxford University Press. The conclusion of this first part is that know-how sometimes does and sometimes does not consist in propositional knowledge. The second part defends an analysis of know-how inspired by Katherine Hawley’ (2003). Success and knowledge-how. American Philosophical Quarterly, 40, pp. 19–31, insightful proposal that know-how requires counterfactual success. I conclude by showing how this analysis helps to explain why know-how sometimes does and sometimes does not consist of propositional knowledge.     

Propositional structure and truth conditions

This paper presents an account of the manner in which a proposition’s immediate structural features are related to its core truth-conditional features. The leading idea is that for a proposition to have a certain immediate structure is just for certain entities to play certain roles in the correct theory of the brute facts regarding that proposition’s truth conditions. The paper explains how this account addresses certain worries and questions recently raised by Jeffery King and Scott Soames.     

Propositional discourse logic

A novel normal form for propositional theories underlies the logic pdl, which captures some essential features of natural discourse, independent from any particular subject matter and related only to its referential structure. In particular, pdlallows to distinguish vicious circularity from the innocent one, and to reason in the presence of inconsistency using a minimal number of extraneous assumptions, beyond the classical ones. Several, formally equivalent decision problems are identified as potential applications: non-paradoxical character of discourses, admissibility of arguments in argumentation networks, propositional satisfiability, and the existence of kernels of directed graphs. Directed graphs provide the basis for the semantics of pdl and the paper concludes by an overview of relevant graph-theoretical results and their applications in diagnosing paradoxical character of natural discourses.