Migrant women are often stereotyped. Some scholars associate the feminization of migration with domestic work and criticize the “care drain” as a new form of imperialism that the First World imposes on the Third World. However, migrant women employed as domestic workers in Northern America and Europe represent only 2% of migrant women worldwide and cannot be seen as characterizing the “feminization of migration”. Why are migrant domestic workers overestimated? This paper explores two possible sources of bias. The first is (...) sampling: conclusions about “care drain” are often generalized from small samples of domestic workers. The second stems from the affect heuristic: imagining children left behind by migrant mothers provokes strong feelings of injustice which trump other considerations. The paper argues that neither source of bias is unavoidable and finds evidence of gender stereotypes in the “care drain” construal. (shrink)

Numerous groups race to discover the gene biomarker whose alteration alone is indicative of a particular disease in all humans. Biomarkers are selected from the most frequently altered genes in large population cohorts. However, thousands of other genes are simultaneously affected, and, in each person, the same disease results from a unique, never-repeatable combination of gene alterations. Therefore, our Genomic Fabric Paradigm (GFP) switches the focus from the alteration of one particular gene to the overall change in selected groups of (...) functionally related genes. Biomarkers are of little therapeutic value, their high alterability indicating low protection by the homeostatic mechanisms as for minor players. Instead of these most alterable genes in all patients, GFP identifies in each patient the genes whose highly protected expression governs major functional pathways by controlling the expression of numerous other genes. Smart manipulation of such (commander) genes would have the maximum therapeutic benefit not for everybody but for the treated person. The genomic fabric is defined as the transcriptome associated with the most interconnected and stably expressed network of genes responsible for a particular functional pathway. The fabric exhibits specificity with respect to race/strain, sex, age, tissue/cell type, and lifestyle and environmental factors. It remodels during development, progression of a disease, and in response to external stimuli. GFP is powered by mathematically advanced analytical tools whose application is illustrated by reprocessing data from previously published gene expression experiments. (shrink)

Fischer’s approach for structure elucidation of linear aldohexoses is still the most widespread alternative in textbooks for carbohydrates. However, in post-Fischer era, a series of remarkable discoveries and inventions were made in different laboratories, and by their use a more comprehensive and coherent strategy for structure elucidation of linear isomeric aldohexoses can be elaborated. Fischer used the exceptional properties of d-mannose for the knowledge of configuration of C-2 and called it the key of the gate to stereochemistry. We bring the (...) evidence that Fischer had an alternative to this monosaccharide, d-idose. Fischer discovered the correct structure of the enantiomers of tartaric acid by pure intuition but Bijvoet proved it experimentally by means of X-rays. Hybridization, a concept taken by L. Pauling from biology, reconciled physics and chemistry concerning the valence of carbon atom and explained the stereochemical picture that had been empirically elaborated by Van’t Hoff and Le Bel. Other chemical transformations of monosaccharides, useful in the elucidation of their structure, have been also discovered or invented in post-Fischer era. (shrink)

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. (shrink)

In this paper we aim to examine a novel view on distributive justice, i.e. limitarianism, which claims that it is morally impermissible to be rich. Our main goal is to assess the two arguments provided by Ingrid Robeyns in favour of limitarianism, namely the democratic argument and the argument from unmet urgent needs and the two distinct limitarian views which these arguments give rise to. We claim that strong limitarianism, which is supported by the democratic argument, should be rejected as (...) it fails to fully instantiate the value of political equality, while having some other unattractive implications as well. By contrast, we argue that weak limitarianism, which is supported by the argument from unmet urgent needs, should be endorsed, albeit in a qualified version which also takes responsibility constraints into consideration. (shrink)

Stalnaker, 169–199 2006) introduced a combined epistemic-doxastic logic that can formally express a strong concept of belief, a concept of belief as ‘subjective certainty’. In this paper, we provide a topological semantics for belief, in particular, for Stalnaker’s notion of belief defined as ‘epistemic possibility of knowledge’, in terms of the closure of the interior operator on extremally disconnected spaces. This semantics extends the standard topological interpretation of knowledge with a new topological semantics for belief. We prove that the belief (...) logic KD45 is sound and complete with respect to the class of extremally disconnected spaces and we compare our approach to a different topological setting in which belief is interpreted in terms of the derived set operator. We also study belief revision as well as belief dynamics by providing a topological semantics for conditional belief and belief update modalities, respectively. Our setting based on extremally disconnected spaces, however, encounters problems when extended with dynamic updates. We then propose a solution consisting in interpreting belief in a similar way based on hereditarily extremally disconnected spaces, and axiomatize the belief logic of hereditarily extremally disconnected spaces. Finally, we provide a complete axiomatization of the logic of conditional belief and knowledge, as well as a complete axiomatization of the corresponding dynamic logic. (shrink)

This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized assignment semantics for first order logic. The expressive strength, complete proof calculus and meta-properties of LFD are explored. Various language extensions are presented as well, up to undecidable modal-style logics for independence and dynamic logics of changing dependence models. Finally, more concrete settings for dependence are discussed: continuous (...) dependence in topological models, linear dependence in vector spaces, and temporal dependence in dynamical systems and games. (shrink)

In this paper we formalize an approach to knowledge that we call Interrogative Epistemology, in the spirit of Hintikka’s “interrogative model” of knowledge. According to our approach, an agent’s knowledge is shaped and limited by her interrogative agenda. The dynamic correlate of this postulate is our Selective Learning principle: the agent’s agenda limits her potential for knowledge-acquisition. Only meaningful information, that is relevant to one’s issues, can really be learnt. We use this approach to propose a new perspective on group (...) knowledge, understood in terms of the epistemic potential of a group of agents: the knowledge that the group may come to possess in common after all members share their individual information. We argue that the standard notions of group knowledge studied in the literature, ranging from distributed knowledge to common knowledge, do not give us a good measure of a group’s epistemic potential. Common knowledge is too weak and too “static”, focusing on what the agents can coordinate upon only based on their actual, current knowledge, thus disregarding testimonial knowledge. In contrast, the concept of distributed knowledge is too strong, being based on the assumption that agents can completely internalize all the testimonial evidence received from others, irrespective of the limitations posed by their own interrogative agendas. We show that a group’s true epistemic potential typically lies in between common knowledge and distributed knowledge. We propose a logical formalization of these concepts, which comes together with a complete axiomatization, and we use this setting to explain both the triumphs and the failures of collective knowledge, treating examples that range from “collective scientific knowledge” [14, 35, 43] to the so-called “curse of the committee”. (shrink)

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 operationalrealistic 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. (shrink)

We present a complete, decidable logic for reasoning about a notion of completely trustworthy evidence and its relations to justifiable belief and knowledge, as well as to their explicit justifications. This logic makes use of a number of evidence-related notions such as availability, admissibility, and “goodness” of a piece of evidence, and is based on an innovative modification of the Fitting semantics for Artemovʼs Justification Logic designed to preempt Gettier-type counterexamples. We combine this with ideas from belief revision and awareness (...) logics to provide an account for explicitly justified knowledge based on conclusive evidence that addresses the problem of omniscience. (shrink)

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. (shrink)

Compositionality is a principle used in logic, philosophy, mathematics, linguistics, and computer science for assigning meanings to language expressions in a systematic manner following syntactic construction, thereby allowing for a perspicuous algebraic view of the syntax-semantics interface. Yet the status of the principle remains under debate, with positions ranging from compositionality always being achievable to its having genuine empirical content. This paper attempts to sort out some major issues in all this from a logical perspective. First, we stress the fundamental (...) harmony between Compositionality and its apparent antipode of Contextuality that locates meaning in interaction with other linguistic expressions and in other settings than the actual one. Next, we discuss basic further desiderata in designing and adjudicating a compositional semantics for a given language in harmony with relevant contextual syntactic and semantic cues. In particular, in a series of concrete examples in the realm of logic, we point out the dangers of over-interpreting compositional solutions, the ubiquitous entanglement of assigning meanings and the key task of explaining given target inferences, and the dynamics of new language design, illustrating how even established compositional semantics can be rethought in a fruitful manner. Finally, we discuss some fresh perspectives from the realm of game semantics for natural and formal languages, the general setting for Samson Abramsky’s influential work on programming languages and process logics. We highlight outside-in coalgebraic perspectives on meanings as finite or infinitely unfolding behavior that might challenge and enrich current discussions of compositionality. (shrink)

We take a logical approach to threshold models, used to study the diffusion of opinions, new technologies, infections, or behaviors in social networks. Threshold models consist of a network graph of agents connected by a social relationship and a threshold value which regulates the diffusion process. Agents adopt a new behavior/product/opinion when the proportion of their neighbors who have already adopted it meets the threshold. Under this diffusion policy, threshold models develop dynamically towards a guaranteed fixed point. We construct a (...) minimal dynamic propositional logic to describe the threshold dynamics and show that the logic is sound and complete. We then extend this framework with an epistemic dimension and investigate how information about more distant neighbors’ behavior allows agents to anticipate changes in behavior of their closer neighbors. Overall, our logical formalism captures the interplay between the epistemic and social dimensions in social networks. (shrink)

We formalise a notion of dynamic rationality in terms of a logic of conditional beliefs on (doxastic) plausibility models. Similarly to other epistemic statements (e.g. negations of Moore sentences and of Muddy Children announcements), dynamic rationality changes its meaning after every act of learning, and it may become true after players learn it is false. Applying this to extensive games, we “simulate” the play of a game as a succession of dynamic updates of the original plausibility model: the epistemic situation (...) when a given node is reached can be thought of as the result of a joint act of learning (via public announcements) that the node is reached. We then use the notion of “stable belief”, i.e. belief that is preserved during the play of the game, in order to give an epistemic condition for backward induction: rationality and common knowledge of stable belief in rationality. This condition is weaker than Aumann’s and compatible with the implicit assumptions (the “epistemic openness of the future”) underlying Stalnaker’s criticism of Aumann’s proof. The “dynamic” nature of our concept of rationality explains why our condition avoids the apparent circularity of the “backward induction paradox”: it is consistent to (continue to) believe in a player’s rationality after updating with his irrationality. (shrink)

We investigate the process of truth-seeking by iterated belief revision with higher-level doxastic information . We elaborate further on the main results in Baltag and Smets (Proceedings of TARK, 2009a , Proceedings of WOLLIC’09 LNAI 5514, 2009b ), applying them to the issue of convergence to truth . We study the conditions under which the belief revision induced by a series of truthful iterated upgrades eventually stabilizes on true beliefs. We give two different conditions ensuring that beliefs converge to (...) “full” (complete) truth , as well as a condition ensuring only that they converge to true (but not necessarily complete) beliefs. (shrink)

We propose a refinement of STIT logic to make it suitable to model causal agency and responsibility in basic multi-agent scenarios in which agents can interfere with one another. We do this by supplementing STIT semantics, first, with action types and, second, with a relation of opposing between action types. We exploit these novel elements to represent a test for potential causation, based on an intuitive notion of expected result of an action, and two tests for actual causation from the (...) legal literature, i.e. the but-for and the NESS tests. We then introduce three new STIT operators modeling corresponding notions of causal responsibility, which we call potential, strong, and plain responsibility, and use them to provide a fine-grained analysis of a number of case studies involving both individual agents and groups. (shrink)

This is the first book on the provocative and innovative contributions to philosophy of language, metaphysics, the philosophy of mathematics, and logic made by Kit Fine, one of the world's foremost philosophers. Topics covered include meaning and representation, arbitrary objects, essence, ontological realism, and the metaphysics of modality.

We study the learning power of iterated belief revision methods. Successful learning is understood as convergence to correct, i.e., true, beliefs. We focus on the issue of universality: whether or not a particular belief revision method is able to learn everything that in principle is learnable. We provide a general framework for interpreting belief revision policies as learning methods. We focus on three popular cases: conditioning, lexicographic revision, and minimal revision. Our main result is that conditioning and lexicographic revision can (...) drive a universal learning mechanism, provided that the observations include only and all true data, and provided that a non-standard, i.e., non-well-founded prior plausibility relation is allowed. We show that a standard, i.e., well-founded belief revision setting is in general too narrow to guarantee universality of any learning method based on belief revision. We also show that minimal revision is not universal. Finally, we consider situations in which observational errors may occur. Given a fairness condition, which says that only finitely many errors occur, and that every error is eventually corrected, we show that lexicographic revision is still universal in this setting, while the other two methods are not. (shrink)