The Mother Relationship and Artistic Inhibition in the Lives of Leonardo da Vinci and Erik H. Erikson

In four earlier articles, I focused on the theme of the relationship of melancholia and the mother, and suggested that the melancholic self may experience humor (Capps, 2007a), play (Capps, 2008a), dreams (Capps, 2007c), and art (Capps, 2008b) as restorative resources. I argued that Erik H. Erikson found these resources to be valuable remedies for his own melancholic condition, which had its origins in the fact that he was illegitimate and was raised solely by his mother until he was three years old, when she remarried. In this article, I focus on two themes in Freud’s Leonardo da Vinci and a memory of his childhood (1964): Leonardo’s relationship with his mother in early childhood and his inhibitions as an artist. I relate these two themes to Erikson’s own early childhood and his failure to achieve his goal as an aspiring artist in his early twenties. The article concludes with a discussion of Erikson’s frustrated aspirations to become an artist and his emphasis, in his psychoanalytic work, on children’s play. Donald Capps is Professor of Pastoral Psychology at Princeton Theological Seminary. His books include Men, Religion, and Melancholia (1997), Freud and Freudians on Religion (2001), and Men and Their Religion: Honor, Hope, and Humor     

The early Russell on the metaphysics of substance in Leibniz and Bradley

While considerable ink has been spilt over the rejection of idealism by Bertrand Russell and G.E. Moore at the end of the 19th Century, relatively little attention has been directed at Russell’s A Critical Exposition of the Philosophy of Leibniz, a work written in the early stages of Russell’s philosophical struggles with the metaphysics of Bradley, Bosanquet, and others. Though a sustained investigation of that work would be one of considerable scope, here I reconstruct and develop a two-pronged argument from the Philosophy of Leibniz that Russell fancied—as late as 1907—to be the downfall of the traditional category of substance. Here, I suggest, one can begin to see Russell’s own reasons—arguments largely independent of Moore—for the abandonment of idealism. Leibniz, no less than Bradley, adhered to an antiquated variety of logic: what Russell refers to as the subject-predicate doctrine of logic. Uniting this doctrine with a metaphysical principle of independence—that a substance is prior to and distinct from its properties—Russell is able to demonstrate that neither a substance pluralism nor a substance monism can be consistently maintained. As a result, Russell alleges that the metaphysics of both Leibniz and Bradley has been undermined as ultimately incoherent. Russell’s remedy for this incoherence is the postulation of a bundle theory of substance, such that the category of “substance” reduces to the most basic entities—properties.     

Resource-origins of Nonmonotonicity

Formal nonmonotonic systems try to model the phenomenon that common sense reasoners are able to “jump” in their reasoning from assumptions Δ to conclusions C without their being any deductive chain from Δ to C. Such jumps are done by various mechanisms which are strongly dependent on context and knowledge of how the actual world functions. Our aim is to motivate these jump rules as inference rules designed to optimise survival in an environment with scant resources of effort and time. We begin with a general discussion and quickly move to Section 3 where we introduce five resource principles. We show that these principles lead to some well known nonmonotonic systems such as Nute’s defeasible logic. We also give several examples of practical reasoning situations to illustrate our principles. Edited by Hannes Leitgeb     

The link between knowledge and remembering in Alzheimer’s disease

Current research on the influence of cognitive support (e.g., activation of task-relevant prior knowledge, item organizability, retrieval cues) on episodic remembering in normal aging and Alzheimer’s disease (AD) is reviewed. Examining the effects of cognitive support on memory may shed light on the relationship between knowledge and remembering, and also provides relevant information pertaining to the development of cognitive intervention procedures. A series of studies from our own and other laboratories reveal a number of interesting empirical regularities. First, AD results in problems in utilizing cognitive support for improving memory. Conceivably, this reduction in cognitive reserve capacity is due to both the overall severity of the episodic memory impairment in AD, as well as to dementia-related deficits in the semantic network that guides encoding and retrieval of information. Nevertheless, AD patients are able to utilize cognitive support in episodic memory tasks, although they typically need more support than their healthy aged counterparts to show memory facilitation. Specifically, it is critical to provide support at both encoding and retrieval in order to demonstrate performance gains in AD. Moreover, successful utilization of retrieval support in this disease is most likely to occur when the encoding requirements force the individual to engage in elaborative cognitive activity (e.g., generation of task-relevant knowledge, categorical organization). Finally, a reduction in cognitive reserve capacity occurs later in the pathogenesis of AD than a generalized episodic memory impairment. This observation reflects the insidious nature of AD, and suggests that the transition from normal aging to AD may be continuous rather than discrete.     

Is ZF a hack?: Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics

This paper presents Automath encodings (which are also valid in LF/λP) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to find out which foundation is the simplest.

The systems analyzed in this way are two kinds of set theory (ZFC and NF), two systems based on Church's higher order logic (Isabelle/Pure and HOL), three kinds of type theory (the calculus of constructions, Luo's extended calculus of constructions, and Martin-Löf's predicative type theory) and one foundation based on category theory.

The conclusions of this paper are that the simplest system is type theory (the calculus of constructions), but that type theories that know about serious mathematics are not simple at all. In that case the set theories are the simplest. If one looks at the number of concepts needed to explain such a system, then higher order logic is the simplest, with twenty-five concepts. On the other side of the scale, category theory is relatively complex, as is Martin-Löf's type theory.

(The full Automath sources of the contexts described in this paper are one the web at http://www.cs.ru.nl/~freek/zfc-etc/.)     

Propositions, Sets, and Worlds

If we agree with Michael Jubien that propositions do not exist, while accepting the existence of abstract sets in a realist mathematical ontology, then the combined effect of these ontological commitments has surprising implications for the metaphysics of modal logic, the ontology of logically possible worlds, and the controversy over modal realism versus actualism. Logically possible worlds as maximally consistent proposition sets exist if sets generally exist, but are equivalently expressed as maximally consistent conjunctions of the same propositions in corresponding sets. A conjunction of propositions, even if infinite in extent, is nevertheless itself a proposition. If sets and hence proposition sets exist but propositions do not exist, then whether or not modal realism is true depends on which of two apparently equivalent methods of identifying, representing, or characterizing logically possible worlds we choose to adopt. I consider a number of reactions to the problem, concluding that the best solution may be to reject the conventional model set theoretical concept of logically possible worlds as maximally consistent proposition sets, and distinguishing between the actual world alone as maximally consistent and interpreting all nonactual merely logically possible worlds as submaximal. I am grateful to the Netherlands Institute for Advanced Study in the Humanities and Social Sciences (NIAS), Royal Netherlands Academy of Arts and Sciences (KNAW), for supporting this among related research projects in philosophical logic and philosophy of mathematics during my Resident Research Fellowship in 2005-2006.     

An Impossibility Theorem on Beliefs in Games

A paradox of self-reference in beliefs in games is identified, which yields a game-theoretic impossibility theorem akin to Russell’s Paradox. An informal version of the paradox is that the following configuration of beliefs is impossible:Ann believes that Bob assumes thatAnn believes that Bob’s assumption is wrongThis is formalized to show that any belief model of a certain kind must have a ‘hole.’ An interpretation of the result is that if the analyst’s tools are available to the players in a game, then there are statements that the players can think about but cannot assume. Connections are made to some questions in the foundations of game theory.Special Issue Ways of Worlds II. On Possible Worlds and Related Notions Edited by Vincent F. Hendricks and Stig Andur Pedersen     

Combinator Logics

Combinator logics are a broad family of substructual logics that are formed by extending the basic relevant logic B with axioms that correspond closely to the reduction rules of proper combinators in combinatory logic. In the Routley-Meyer relational semantics for relevant logic each such combinator logic is characterized by the class of frames that meet a first-order condition that also directly corresponds to the same combinator's reduction rule. A second family of logics is also introduced that extends B with the addition of propositional constants that correspond to combinators. These are characterized by relational frames that meet first-order conditions that reflect the structures of the combinators themselves.     

A Sequent Formulation of Conditional Logic Based on Belief Change Operations

Peter Gärdenfors has developed a semantics for conditional logic, based on the operations of expansion and revision applied to states of information. The account amounts to a formalisation of the Ramsey test for conditionals. A conditional A > B is declared accepted in a state of information K if B is accepted in the state of information which is the result of revising K with respect to A. While Gärdenfors's account takes the truth-functional part of the logic as given, the present paper proposes a semantics entirely based on epistemic states and operations on these states. The semantics is accompanied by a syntactic treatment of conditional logic which is formally similar to Gentzen's sequent formulation of natural deduction rules. Three of David Lewis's systems of conditional logic are represented. The formulations are attractive by virtue of their transparency and simplicity.     

Quantized Linear Logic,Involutive Quantales and Strong Negation

A new logic, quantized intuitionistic linear logic (QILL), is introduced, and is closely related to the logic which corresponds to Mulvey and Pelletier's (commutative) involutive quantales. Some cut-free sequent calculi with a new property quantization principle and some complete semantics such as an involutive quantale model and a quantale model are obtained for QILL. The relationship between QILL and Wansing's extended intuitionistic linear logic with strong negation is also observed using such syntactical and semantical frameworks.