The transcoding processes in patients with agraphia to dictation

The main purpose of the present study is to prove that the mechanism of transcoding, that is, of transposition of certain units of a sign system into the corresponding ones of another sign system, is an independent mechanism. We attempted to demonstrate this thesis with reference to certain transcoding processes within the verbal function of writing to dictation, in particular, by examining the agraphic disturbances in aphasics on this form of writing. We found that this type of agraphia in patients with an intact input stage (i.e., intact auditory and visual word perception) but with a blocked shift from the phonetic to the graphemic level (even in cases with intact auditory and visual word perception), or in those with a blocked shift to the grapho-motor one (even in cases with intact copying), is due to disturbed mechanisms of transcoding. The fact that in patients with pure writing-to-dictation disability copied writing is not disturbed proves that the transcoding process is selectively blocked. Transcoding processes in copying and total agraphia are discussed by comparison.     

Quantum logic as a dynamic logic

We address the old question whether a logical understanding of Quantum Mechanics requires abandoning some of the principles of classical logic. Against Putnam and others (Among whom we may count or not E. W. Beth, depending on how we interpret some of his statements), our answer is a clear “no”. Philosophically, our argument is based on combining a formal semantic approach, in the spirit of E. W. Beth’s proposal of applying Tarski’s semantical methods to the analysis of physical theories, with an empirical–experimental approach to Logic, as advocated by both Beth and Putnam, but understood by us in the view of the operational- realistic tradition of Jauch and Piron, i.e. as an investigation of “the logic of yes–no experiments” (or “questions”). Technically, we use the recently-developed setting of Quantum Dynamic Logic (Baltag and Smets 2005, 2008) to make explicit the operational meaning of quantum-mechanical concepts in our formal semantics. Based on our recent results (Baltag and Smets 2005), we show that the correct interpretation of quantum-logical connectives is dynamical, rather than purely propositional. We conclude that there is no contradiction between classical logic and (our dynamic reinterpretation of) quantum logic. Moreover, we argue that the Dynamic-Logical perspective leads to a better and deeper understanding of the “non-classicality” of quantum behavior than any perspective based on static Propositional Logic.     

Animal Experience: A Formal-Indicative Approach to Martin Heidegger’s Account of Animality

In the present paper I attempt an interpretation of Martin Heidegger’s analysis of animality, developed in winter semester 1929/1930. My general purpose is to examine Heidegger’s analysis in the wider context of formal-indicative phenomenology as such. Thus I show that in order to develop a phenomenology of animality, Heidegger must tacitly renounce the re-enactment of animal experience in which the formal-indicative concepts of his analysis could gain concreteness, and he resorts instead to scientific concepts and concrete experiments in biology or zoology. This is due to the fact that what I call the a-logical bursts into the field of the phenomenological regard when it is oriented toward animality. I therefore argue that the phenomenology of animality presents us with a paradigmatic case of a tension that is at work in any phenomenon, one between logos and a-logos, between hiddenness and unhiddenness—constituting a basic problem of future research in phenomenology and its approach to intersubjectivity and alterity.     

Bisimulation for Conditional Modalities

We give a definition of bisimulation for conditional modalities interpreted on selection functions and prove the correspondence between bisimilarity and modal equivalence, generalizing the Hennessy–Milner Theorem to a wide class of conditional operators. We further investigate the operators and semantics to which these results apply. First, we show how to derive a solid notion of bisimulation for conditional belief, behaving as desired both on plausibility models and on evidence models. These novel definitions of bisimulations are exploited in a series of undefinability results. Second, we treat relativized common knowledge, underlining how the same results still hold for a different modality in a different semantics. Third, we show the flexibility of the approach by generalizing it to multi-agent systems, encompassing the case of multi-agent plausibility models.     

Logics of Informational Interactions

The pre-eminence of logical dynamics, over a static and purely propositional view of Logic, lies at the core of a new understanding of both formal epistemology and the logical foundations of quantum mechanics. Both areas appear at first sight to be based on purely static propositional formalisms, but in our view their fundamental operators are essentially dynamic in nature. Quantum logic can be best understood as the logic of physically-constrained informational interactions (in the form of measurements and entanglement) between subsystems of a global physical system. Similarly, (multi-agent) epistemic logic is the logic of socially-constrained informational interactions (in the form of direct observations, learning, various forms of communication and testimony) between “subsystems” of a social system. Dynamic Epistemic Logic (DEL) provides us with a unifying setting in which these informational interactions, coming from seemingly very different areas of research, can be fully compared and analyzed. The DEL formalism comes with a powerful set of tools that allows us to make the underlying dynamic/interactive mechanisms fully transparent.     

On the formation of collective memories: The role of a dominant narrator

To test our hypothesis that conversations can contribute to the formation of collective memory, we asked participants to study stories and to recall them individually (pregroup recollection), then as a group (group recounting), and then once again individually (postgroup recollection). One way that postgroup collective memories can be formed under these circumstances is if unshared pregroup recollections in the group recounting influences others' postgroup recollections. In the present research, we explored (using tests of recall and recognition) whether the presence of a dominant narrator can facilitate the emergence of unshared pregroup recollections in a group recounting and whether this emergence is associated with changes in postgroup recollections. We argue that the formation of a collective memory through conversation is not inevitable but is limited by cognitive factors, such as conditions for social contagion, and by situational factors, such as the presence of a narrator.     

Logics for Epistemic Programs

We construct logical languages which allow one to represent a variety of possible types of changes affecting the information states of agents in a multi-agent setting. We formalize these changes by defining a notion of epistemic program. The languages are two-sorted sets that contain not only sentences but also actions or programs. This is as in dynamic logic, and indeed our languages are not significantly more complicated than dynamic logics. But the semantics is more complicated. In general, the semantics of an epistemic program is what we call aprogram model. This is a Kripke model of ‘actions’,representing the agents' uncertainty about the current action in a similar way that Kripke models of ‘states’ are commonly used in epistemic logic to represent the agents' uncertainty about the current state of the system. Program models induce changes affecting agents' information, which we represent as changes of the state model, called epistemic updates. Formally, an update consists of two operations: the first is called the update map, and it takes every state model to another state model, called the updated model; the second gives, for each input state model, a transition relation between the states of that model and the states of the updated model. Each variety of epistemic actions, such as public announcements or completely private announcements to groups, gives what we call an action signature, and then each family of action signatures gives a logical language. The construction of these languages is the main topic of this paper. We also mention the systems that capture the valid sentences of our logics. But we defer to a separate paper the completeness proof. The basic operation used in the semantics is called the update product. A version of this was introduced in Baltag et al. (1998), and the presentation here improves on the earlier one. The update product is used to obtain from any program model the corresponding epistemic update, thus allowing us to compute changes of information or belief. This point is of interest independently of our logical languages. We illustrate the update product and our logical languages with many examples throughout the paper.     

Paternal involvement elevates trajectories of life satisfaction during transition to parenthood

This study explored the role of fathers' involvement for life satisfaction changes among 598 cohabitating couples before and after childbirth using data from the German Socio-Economic Panel (GSOEP). We included longitudinal data and reports from both parents on their time spent on housework and childcare and their life satisfaction. Piecewise latent growth models showed that fathers' relative involvement trajectories for housework and childcare (amount of time men spent compared to their partners) were positively correlated. Fathers' relative involvement was perceived as supportive for mothers' childcare. In families where fathers were more involved, life satisfaction trajectories were much steeper; both parents had elevated levels around birth and returned to their baseline levels compared to families with less-involved fathers. Fathers who were less involved did not increase in life satisfaction at birth and decreased below their baseline levels within the third year post-birth.     

Probabilistic dynamic belief revision

We investigate the discrete (finite) case of the Popper–Renyi theory of conditional probability, introducing discrete conditional probabilistic models for knowledge and conditional belief, and comparing them with the more standard plausibility models. We also consider a related notion, that of safe belief, which is a weak (non-negatively introspective) type of “knowledge”. We develop a probabilistic version of this concept (“degree of safety”) and we analyze its role in games. We completely axiomatize the logic of conditional belief, knowledge and safe belief over conditional probabilistic models. We develop a theory of probabilistic dynamic belief revision, introducing probabilistic “action models” and proposing a notion of probabilistic update product, that comes together with appropriate reduction laws.