Names,identity, and predication

It is commonly accepted, after Frege, that identity statements like “Tully is Cicero” differ from statements like “Tully is Tully”. For the former, unlike the latter, are informative. One way to deal with the information problem is to postulate that the terms ‘Tully’ and ‘Cicero’ come equipped with different informative (or cognitive) values. Another approach is to claim that statements like these are of the subject/predicate form. As such, they should be analyzed along the way we treat “Tully walks”. Since proper names can appear in predicative position we could go as far as to dismiss the sign of identity altogether, some told us. I will try to discuss the advantages and/or disadvantages of this approach and investigate whether Frege’s view that the ‘is’ of identity must be distinguished from the ‘is’ of predication (copula) can be reconciled with the fact that names can appear in predicative position.     

Semantic representation and ease of predication

Jones' (1985) Ease of Predication hypothesis, which states that underlying differences in the semantic representation of concrete and abstract words can be explained in terms of disproportionate numbers of semantic predicates, is explored in two experiments. The results suggest that (1) the advantage shown by concrete words in terms of greater number of predicates is only apparent for words of low frequency, and (2) Jones' case of predication variable does not accurately reflect predicate distributions, or differences in imageability. Rather, it appears to represent differences in concreteness. As such, the validity of this concept as the basis of theories of semantic representation is questioned. Models based on the assumption of a "richer" semantic representation for concrete words are therefore not supported.     

Relevant predication: Grammatical characterisations

This paper reformulates and decides a certain conjecture in Dunn's Relevant Predication 1: The Formal Theory (Journal of Philosophical Logic 16, 347–381, 1987). This conjecture of Dunn's relates his object-language characterisation of a property's being relevant in a variable x to certain grammatical characterisations of relevance, analogous to some given by Helman, in Relevant Implication and Relevant Functions (to appear in Entailment: The Logic of Relevance and Necessity, vol. 2, by Alan Ross Anderson, Nuel Belnap, and J. Michael Dunn et al.) In the course of the investigation this paper also investigates Kit Fine's semantics for quantified relevance logics, which appears in his appropriately titled Semantics for Quantified Relevance LogicsMany thanks go to Nuel Belnap who suggested this research topic, and whose comments and inspiration were most appreciated.     

Structured propositions and the logical form of predication

Synthese - Jeffrey King, Scott Soames, and others have recently challenged the familiar identification of a Russellian proposition, such as the proposition that Brutus stabbed Caesar, with an...     

Deep dyslexia, imageability, and ease of predication

A development of existing theories of deep dyslexia is outlined. It proposes that the effects of imageability upon the ease of reading of words by deep dyslexics occur as a result of variation in the ease with which individual words summon semantic predicates, on the basis of which reading responses can be made. Ease-of-predication scores are obtained for a corpus of nouns and found to be, as hypothesized, closely related to imageability scores. It is shown that the other major characteristics of deep dyslexia can also be accounted for by this proposed mechanism. These include the well-established effects of syntactic category (in particular, of the distinction between content and function words) upon reading. Further evidence is provided that this effect may be attributed to variation in ease of predication.     

A theory of the discovery and predication of relational concepts

Relational thinking plays a central role in human cognition. However, it is not known how children and adults acquire relational concepts and come to represent them in a form that is useful for the purposes of relational thinking (i.e., as structures that can be dynamically bound to arguments). The authors present a theory of how a psychologically and neurally plausible cognitive architecture can discover relational concepts from examples and represent them as explicit structures (predicates) that can take arguments (i.e., predicate them). The theory is instantiated as a computer program called DORA (Discovery Of Relations by Analogy). DORA is used to simulate the discovery of novel properties and relations, as well as a body of empirical phenomena from the domain of relational learning and the development of relational representations in children and adults.