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 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 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 reasoning and working memory: the role of prior training and pragmatic content

Working memory involvement in propositional reasoning was explored after different kinds of training. The training conditions aimed to reduce the impact of non-analytic heuristics and to enhance analytic inference processes according to mental logic theories, the mental model theory, and the theory of pragmatic reasoning schemata. Following an initial training phase, secondary task interference was investigated using concurrent spatial tapping (Experiment 1), random number generation (Experiment 2), and articulatory suppression (Experiment 3). A training condition practicing the construction and use of mental models via a truth table task increased the disruption of reasoning performance by random number generation and articulatory suppression, whereas the other training conditions did not affect susceptibility to secondary task interference. The results corroborate implications of the mental model theory of reasoning.     

Propositional self-control in children

The scope of Dulany's (1968) Theory of Propositional Control was examined using 54 $\text{11}\text{1}\text{2}\text{-, 8}\text{1}\text{2}\text{-,}\text{and 4}\text{1}\text{2}\text{-year-olds}$. Significance of the reinforcer was manipulated orthogonally to value of the reinforcer. With a six attribute concept attainment task $\text{4}\text{1}\text{2}\text{-}\text{year-olds}$ did not learn in either of two significant ways: a performance change over blocks, nor the acquisition of a rule of reinforcement. Children of $\text{8}\text{1}\text{2}$ and $\text{11}\text{1}\text{2}$ learned in both of the above senses. In addition, for the latter subjects the central equations of the theory held with strength and subjects' intentions accounted for more variance in performance than did the experimental manipulations. In supplementary experiments using a simplified task some $\text{4}\text{1}\text{2}\text{-}\text{year-olds}$ learned. When only the $\text{4}\text{1}\text{2}\text{-}\text{year-olds}$ who learned to a criterion were examined the central equations of the theory were nearly as strong as for subjects at ages $\text{8}\text{1}\text{2}$ and $\text{11}\text{1}\text{2}$. There was no evidence for learning without awareness at any age level.     

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.     

Actuality in Propositional Modal Logic

We show that the actuality operator A is redundant in any propositional modal logic characterized by a class of Kripke models (respectively, neighborhood models). Specifically, we prove that for every formula ${\phi}$ in the propositional modal language with A, there is a formula ${\psi}$ not containing A such that ${\phi}$ and ${\psi}$ are materially equivalent at the actual world in every Kripke model (respectively, neighborhood model). Inspection of the proofs leads to corresponding proof-theoretic results concerning the eliminability of the actuality operator in the actuality extension of any normal propositional modal logic and of any “classical” modal logic. As an application, we provide an alternative proof of a result of Williamson’s to the effect that the compound operator A□ behaves, in any normal logic between T and S5, like the simple necessity operator □ in S5.     

Propositional Attitudes Without Propositions

The most common account of attitude reports is the relational analysis according towhich an attitude verb taking that-clause complements expresses a two-placerelation between agents and propositions and the that-clause acts as an expressionwhose function is to provide the propositional argument. I will argue that a closerexamination of a broader range of linguistic facts raises serious problems for thisanalysis and instead favours a Russellian `multiple relations analysis' (which hasgenerally been discarded because of its apparent obvious linguistic implausibility).The resulting account can be given independent philosophical motivations within anintentionalist view of truth and predication.     

Cn-Definitions of Propositional Connectives

We attempt to define the classical propositional logic by use of appropriate derivability conditions called Cn-definitions. The conditions characterize basic properties of propositional connectives.     

Propositional relevance through letter-sharing

The concept of relevance between classical propositional formulae, defined in terms of letter-sharing, has been around for a long time. But it began to take on a fresh life in the late 1990s when it was reconsidered in the context of the logic of belief change. Two new ideas appeared in independent work of Odinaldo Rodrigues and Rohit Parikh: the relation of relevance was considered modulo the choice of a background belief set, and the belief set was put into a canonical form, called its finest splitting. In the first part of this paper, we recall the ideas of Rodrigues and Parikh, and show that they yield equivalent definitions of what may be called canonical cell/path relevance. The second part presents the main new result of the paper: while the relation of canonical relevance is syntax-independent in the usual sense of the term, it nevertheless remains language-dependent in a deeper sense, as is shown with an example. The final part of the paper turns to questions of application, where we present a new concept of parameter-sensitive relevance that relaxes the Rodrigues/Parikh definition, allowing it to take into account extra-logical sources as well as purely logical ones.     

Propositional Logic of Essence

This paper presents a propositional version of Kit Fine"s (quantified) logic for essentialist statements, provides it with a semantics, and proves the former adequate (i.e. sound and complete) with respect to the latter.     

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.     

Double-Negation Elimination in Some Propositional Logics

This article answers two questions (posed in the literature), each concerning the guaranteed existence of proofs free of double negation. A proof is free of double negation if none of its deduced steps contains a term of the formn(n(t)) for some term t, where n denotes negation. The first question asks for conditions on the hypotheses that, if satisfied, guarantee the existence of a double-negation-free proof when the conclusion is free of double negation. The second question asks about the existence of an axiom system for classical propositional calculus whose use, for theorems with a conclusion free of double negation, guarantees the existence of a double-negation-free proof. After giving conditions that answer the first question, we answer the second question by focusing on the Lukasiewicz three-axiom system. We then extend our studies to infinite-valued sentential calculus and to intuitionistic logic and generalize the notion of being double-negation free. The double-negation proofs of interest rely exclusively on the inference rule condensed detachment, a rule that combines modus ponens with an appropriately general rule of substitution. The automated reasoning program Otter played an indispensable role in this study.