Hemingway's Aging Heroes and the Concept of Phronesis

This article explores the concept of phronesis (practical wisdom) in four aging protagonists in Ernest Hemingway's works ranging from the short story A Clean Well-Lighted Place to the novella The Old Man and the Sea. Phronesis represents an understanding of the ways of the world, an acute sensitivity to a critical logic of human existence that can be attained only through extensive experience and suffering. The four aging protagonists are examples of Hemingway's definition of aging productively and profitably by purchasing an inner peace that consists of an intuitive system of continuous adjustment to the exigencies of daily living.     

Reasoning and logic

Gilbert Harman, in Logic and Reasoning (Synthese 60 (1984), 107–127) describes an unsuccessful attempt ... to develop a theory which would give logic a special role in reasoning. Here reasoning is psychological, a procedure for revising one's beliefs. In the present paper, I construe reasoning sociologically, as a process of linguistic interaction; and show how both reasoning in the psychologistic sense and logic are related to that process.     

In and behind a Lenneberg paradigm

Lenneberg suggested that a chimpanzee's linguistic ability could be tested by presenting sentences containing two prepositional phrases joined by a conjunction. This would involve joining two semantic propositions, and thus represents a more complex test of chimpanzee syntactic competence than previously attempted. Jane, a five year-old language trained chimpanzee, was tested on her ability to both produce and comprehend sentences involving a preposition (in or behind) and a conjunction (and). The results from production and comprehension were substantially the same. Jane showed the ability to appropriately deploy and, behind and in, but displayed very little flexibility in their use. It is suggested that a chimpanzee may be able to learn some rules of syntax but is not able to be creative with that syntax.     

Supererogation in Deontic Logic: Metatheory for DWE and Some Close Neighbours

In "Doing Well Enough: Toward a Logic for Common Sense Morality", Paul McNamara sets out a semantics for a deontic logic which contains the operator It is supererogatory that. As well as having a binary accessibility relation on worlds, that semantics contains a relative ordering relation, . For worlds u, v and w, we say that u w v when v is at least as good as u according to the standards of w. In this paper we axiomatize logics complete over three versions of the semantics. We call the strongest of these logics DWE for Doing Well Enough.     

The elimination of de re formulas

It is shown that de re formulas are eliminable in the modal logic S5 extended with the axiom scheme x x.     

Impulse and Self-Reflection: Frankfurtian Responsibility versus Free Will

Harry Frankfurt's early work makes an important distinction between moral responsibility and free will. Frankfurt begins by focusing on the notion of responsibility, as supplying counterexamples to the principle of alternative possibilities; he then turns to an apparently independent account of free will, in terms of his well-known hierarchy of desires. But the two notions seem to reestablish contact in Frankfurt's later discussion of issues and cases. The present article sets up a putative Frankfurtian account of moral responsibility that involves the potential for free will, as suggested by some of Frankfurt's later remarks about taking responsibility. While correcting what seem to be some common misinterpretations of Frankfurt's view, the article attempts to extract some reasons for dissatisfaction with it from consideration of cases of unfreedom, particularly cases involving addiction.     

A Sound and Complete Tableau Calculus for Reasoning about only Knowing and Knowing at Most

We define a tableau calculus for the logic of only knowing and knowing at most ON, which is an extension of Levesque's logic of only knowing O. The method is based on the possible-world semantics of the logic ON, and can be considered as an extension of known tableau calculi for modal logic K45. From the technical viewpoint, the main features of such an extension are the explicit representation of "unreachable" worlds in the tableau, and an additional branch closure condition implementing the property that each world must be either reachable or unreachable. The calculus allows for establishing the computational complexity of reasoning about only knowing and knowing at most. Moreover, we prove that the method matches the worst-case complexity lower bound of the satisfiability problem for both ON and O. With respect to [22], in which the tableau calculus was originally presented, in this paper we both provide a formal proof of soundness and completeness of the calculus, and prove the complexity results for the logic ON.     

On superintuitionistic logics as fragments of proof logic extensions

Coming fromI andCl, i.e. from intuitionistic and classical propositional calculi with the substitution rule postulated, and using the sign to add a new connective there have been considered here: Grzegorozyk's logicGrz, the proof logicG and the proof-intuitionistic logicI set up correspondingly by the calculiFor any calculus we denote by the set of all formulae of the calculus and by the lattice of all logics that are the extensions of the logic of the calculus, i.e. sets of formulae containing the axioms of and closed with respect to its rules of inference. In the logiclG the sign is decoded as follows: A = (A & A). The result of placing in the formulaA before each of its subformula is denoted byTrA. The maps are defined (in the definitions of x and the decoding of is meant), by virtue of which the diagram is constructedIn this diagram the maps, x and are isomorphisms, thereforex ^–1 = ; and the maps and are the semilattice epimorphisms that are not commutative with lattice operation +. Besides, the given diagram is commutative, and the next equalities take place: ^–1 = ^–1 and = ^–1 x. The latter implies in particular that any superintuitionistic logic is a superintuitionistic fragment of some proof logic extension.     

Is “some-other-time” sometimes better than “sometime” for proving partial correctness of programs?

The main result of this paper belongs to the field of the comparative study of program verification methods as well as to the field called nonstandard logics of programs. We compare the program verifying powers of various well-known temporal logics of programs, one of which is the Intermittent Assertions Method, denoted as Bur. Bur is based on one of the simplest modal logics called S5 or sometime-logic. We will see that the minor change in this background modal logic increases the program verifying power of Bur. The change can be described either technically as replacing the reflexive version of S5 with an irreflexive version, or intuitively as using the modality some-other-time instead of sometime. Some insights into the nature of computational induction and its variants are also obtained.This project was supported by the Hungarian National Foundation for Scientific Research, Grant No. 1810.     

Interaction of color and geometric cues in depth perception: When does “red” mean “near”?

Luminance and color are strong and self-sufficient cues to pictorial depth in visual scenes and images. The present study investigates the conditions under which luminance or color either strengthens or overrides geometric depth cues. We investigated how luminance contrast associated with the color red and color contrast interact with relative height in the visual field, partial occlusion, and interposition to determine the probability that a given figure presented in a pair is perceived as nearer than the other. Latencies of near responses were analyzed to test for effects of attentional selection. Figures in a pair were supported by luminance contrast (Experiment 1) or isoluminant color contrast (Experiment 2) and combined with one of the three geometric cues. The results of Experiment 1 show that the luminance contrast of a color (here red), when it does not interact with other colors, produces the same effects as achromatic luminance contrasts. The probability of near increases with the luminance contrast of the color stimulus, the latencies for near responses decrease with increasing luminance contrast. Partial occlusion is found to be a strong enough pictorial cue to support a weaker red luminance contrast. Interposition cues lose out against cues of spatial position and partial occlusion. The results of Experiment 2, with isoluminant displays of varying color contrast, reveal that red color contrast on a light background supported by any of the three geometric cues wins over green or white supported by any of the three geometric cues. On a dark background, red color contrast supported by the interposition cue loses out against green or white color contrast supported by partial occlusion. These findings reveal that color is not an independent depth cue, but is strongly influenced by luminance contrast and stimulus geometry. Systematically shorter response latencies for stronger near percepts demonstrate that selective visual attention reliably detects the most likely depth cue combination in a given configuration.     

The logical structure of linguistic commitment II: Systems of relevant commitment entailment

In The Logical Structure of Linguistic Commitment I (The Journal of Philosophical Logic 23 (1994), 369–400), we sketch a linguistic theory (inspired by Brandom's Making it Explicit) which includes an expressivist account of the implication connective, : the role of is to make explicit the inferential proprieties among possible commitments which proprieties determine, in part, the significances of sentences. This motivates reading (A B) as commitment to A is, in part, commitment to B. Our project is to study the logic of . LSLC I approximates (A B) as anyone committed to A is committed to B, ignoring issues of whether A is relevant to B. The present paper includes considerations of relevance, motivating systems of relevant commitment entailment related to the systems of commitment entailment of LSLC I. We also consider the relevance logics that result from a commitment reading of Fine's semantics for relevance logics, a reading that Fine suggests.     

Depression and Anxiety in Persons with Parkinson's Disease With and Without “On–Off” Phenomena

On–off phenomena in Parkinson's disease (PD) are unpredictable motor fluctuations associated with long-term levodopa use. Mood fluctuations have been found to coincide with the motor fluctuations in that depression and anxiety increase while the person with PD is in the off state. What has been relatively unexplored is whether those persons with PD who have on–off phenomena differ psychologically in fundamental ways from those who do not have on–off phenomena. In the present study, depression and anxiety symptoms were assessed in 36 persons with PD (n = 14 with on–off phenomena, n = 22 without on–off phenomena). All those with on–off phenomena were assessed in their on state. Those persons with PD with on–off phenomena had significantly higher levels of anxiety than those without on–off phenomena. However, both groups, regardless of on–off status, were mildly depressed. Neurobiological interpretations of the results implicate the locus coeruleus in the pathogenesis of both on–off phenomena and anxiety, whereas psychological interpretations of the results involve the issues of learned helplessness and control over health symptoms in PD.     

Distinctions between subgroups of asthmatic children: Parental reactions to experimental separation

Parental reactions to experimental separation were analyzed for two groups of asthmatic children, those for whom behavioral factors were judged highly relevant to asthma and those for whom such factors appeared unimportant. The former group of 13 (predicted positives) had shown a highly significant improvement in asthma during separation from their families; the latter group of 12 (predicted negatives) had not. Coding of standardized interviews conducted around the time of separation disclosed that parents (mothers, especially) of predicted positives scored significantly higher than parents of predicted negatives on such scales as fussing over the child at the time of leave taking, missing child, experiencing pain and discomfort during the separation, being anxious over child's welfare, etc. Psychological test data did not discriminate between the parents' or childrens' groups as clearly as the more focused separation interviews but the test results were consistent with interview differences. The separation elicited very strong emotional reactions from several mothers.This study was supported by United States Public Health Service Grant No. HD01060 from the National Institute of Child Health and Human Development. Kirk Brady, John Means, loan Muser, and Claire Purcell contributed to data collection and/or data analysis.     

Variations in use of the term “or”

Two studies showed that adults' responses to questions involving the term or varied markedly depending upon the type of question presented. When presented with various objects (A's and B's) and asked to circle all things which are A or B subjects tended to circle A's as well as B's, whereas when asked to circle all the A's or B's subjects showed a relatively stronger tendency to circle one or the other. Moreover the nature of the sets of objects (As and Bs) influenced behavior as well. There was also evidence that the effects due to question wording or set type transferred.     

Identity in modal logic theorem proving

THINKER is an automated natural deduction first-order theorem proving program. This paper reports on how it was adapted so as to prove theorems in modal logic. The method employed is an indirect semantic method, obtained by considering the semantic conditions involved in being a valid argument in these modal logics. The method is extended from propositional modal logic to predicate modal logic, and issues concerning the domain of quantification and existence in a world's domain are discussed. Finally, we look at the very interesting issues involved with adding identity to the theorem prover in the realm of modal predicate logic. Various alternatives are discussed.     

Faithful Aging and the Development of Character

The author tests the kinship of the concepts faithful aging, the centerpiece of her book, The Art of Growing Old: A Guide to Faithful Aging (1998), and development of character, central to James Hillman's book, The Force of Character and the Lasting Life (1999). Faithful aging is assessed in characters from two plays: Graham Greene's The Potting Shed and Robert Anderson's I Never Sang for My Father. Finally, Saussy reflects on the development of character as a theological issue.     

A Translation of Intuitionistic Predicate Logic into Basic Predicate Logic

Basic Predicate Logic, BQC, is a proper subsystem of Intuitionistic Predicate Logic, IQC. For every formula in the language {, , , , , , }, we associate two sequences of formulas 0,1,... and 0,1,... in the same language. We prove that for every sequent , there are natural numbers m, n, such that IQC , iff BQC n m. Some applications of this translation are mentioned.     

Syntactical investigations intoBI logic andBB′I logic

In this note, we will study four implicational logicsB, BI, BB and BBI. In [5], Martin and Meyer proved that a formula is provable inBB if and only if is provable inBBI and is not of the form of » . Though it gave a positive solution to theP - W problem, their method was semantical and not easy to grasp. We shall give a syntactical proof of the syntactical relation betweenBB andBBI logics. It also includes a syntactical proof of Powers and Dwyer's theorem that is proved semantically in [5]. Moreover, we shall establish the same relation betweenB andBI logics asBB andBBI logics. This relation seems to say thatB logic is meaningful, and so we think thatB logic is the weakest among meaningful logics. Therefore, by Theorem 1.1, our Gentzentype system forBI logic may be regarded as the most basic among all meaningful logics. It should be mentioned here that the first syntactical proof ofP - W problem is given by Misao Nagayama [6].Presented byHiroakira Ono     

On the non-availability of Dawson-modeling into certain relevance alethic modal logics

This paper shows that the Dawson technique of modelling deontic logics into alethic modal logics to gain insight into deontic formulas is not available for modelling a normal (in the spirit of Anderson) relevance deontic modal logic into either of the normal relevance alethic modal logics R _S4or R _M. The technique is to construct an extension of the well known entailment matrix set M ₀and show that the model of the deontic formula P (A v B). PA v PB is excluded.