We performed three experiments to investigate whether adjectives can modulate the sensorimotor activation elicited by nouns. In Experiment 1, nouns of graspable objects were used as stimuli. Participants had to decide if each noun referred to a natural or artifact, by performing either a precision or a power reach‐to‐grasp movement. Response grasp could be compatible or incompatible with the grasp typically used to manipulate the objects to which the nouns referred. The results revealed faster reaction times (RTs) in compatible than (...) in incompatible trials. In Experiment 2, the nouns were combined with adjectives expressing either disadvantageous information about object graspability (e.g., sharp) or information about object color (e.g., reddish). No difference in RTs between compatible and incompatible conditions was found when disadvantageous adjectives were used. Conversely, a compatibility effect occurred when color adjectives were combined with nouns referring to natural objects. Finally, in Experiment 3 the nouns were combined with adjectives expressing tactile or shape proprieties of the objects (e.g., long or smooth). Results revealed faster RTs in compatible than in incompatible condition for both noun categories. Taken together, our findings suggest that adjectives can shape the sensorimotor activation elicited by nouns of graspable objects, highlighting that language simulation goes beyond the single‐word level. (shrink)

This study investigates whether and how sex and race affect access to and rewards for job authority, using 1980 survey data for 1,216 employed workers. The authors examine whether, net of human-capital characteristics, sex and race affect access to and compensation for job authority. In addition, the authors examine whether the translation of credentials into authority and earnings varies depending on workers' sex or race.

Anderson and Csima :245–264, 2014) defined a jump operator, the bounded jump, with respect to bounded Turing reducibility. They showed that the bounded jump is closely related to the Ershov hierarchy and that it satisfies an analogue of Shoenfield jump inversion. We show that there are high bounded low sets and low bounded high sets. Thus, the information coded in the bounded jump is quite different from that of the standard jump. We also consider whether the analogue of the Jump (...) Theorem holds for the bounded jump: do we have A≤bTB\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A \le _{bT}B$$\end{document} if and only if Ab≤1Bb\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A^b \le _1 B^b$$\end{document}? We show the forward direction holds but not the reverse. (shrink)

To each computable enumerable (c.e.) set A with a particular enumeration {As}s∈ω, there is associated a settling function mA(x), where mA(x) is the last stage when a number less than or equal to x was enumerated into A. One c.e. set A is settling time dominated by another set B (B >st A) if for every computable function f, for all but finitely many x, mB(x) > f(m₄(x)). This settling-time ordering, which is a natural extension to an ordering of the (...) idea of domination, was first introduced by Nabutovsky and Weinberger in [3] and Soare [6]. They desired a sequence of sets descending in this relationship to give results in differential geometry. In this paper we examine properties of the <st ordering. We show that it is not invariant under computable isomorphism, that any countable partial ordering embeds into it, that there are maximal and minimal sets, and that two c.e. sets need not have an inf or sup in the ordering. We also examine a related ordering, the strong settling-time ordering where we require for all computable f and g, for almost all x, mB(x) > f(mA(g(x))). (shrink)

A real is called properly n-generic if it is n-generic but not n+1-generic. We show that every 1-generic real computes a properly 1-generic real. On the other hand, if m > n ≥ 2 then an m-generic real cannot compute a properly n-generic real.

Este texto propõe discutir a controvérsia sobre o uso dos transgênicos na agricultura e pergunta também pela possibilidade de uma alternativa melhor a eles. Quando falamos em controvérsia, referimo-nos a uma discussão sobre ideias que refletem posturas opostas. Serão, portanto, apresentadas duas perspectivas distintas a respeito do tema: a perspectiva dos proponentes da transgenia e a dos críticos. A partir da perspectiva crítica, a agroecologia será elencada como possível alternativa para produção de alimentos considerando sua dimensão ética.

The data produced by the scientific community impacts on academia, clinicians, and the general public; therefore, the scientific community and other regulatory bodies have been focussing on ethical codes of conduct. Despite the measures taken by several research councils, unethical research, publishing and/or reviewing behaviours still take place. This exploratory study considers some of the current unethical practices and the reasons behind them and explores the ways to discourage these within research and other professional disciplinary bodies. These interviews/discussions with PhD (...) students, technicians, and academics/principal investigators were conducted mostly in European higher education institutions including UK, Italy, Ireland, Portugal, Czech Republic and Netherlands.Through collegiate discussions, sharing experiences and by examining previously published/reported information, authors have identified several less reported behaviours. Some of these practices are mainly influenced either by the undue institutional expectations of research esteem or by changes in the journal review process. These malpractices can be divided in two categories relating to methodological malpractices including data management, and those that contravene publishing ethics. The former is mostly related to “committed bias”, by which the author selectively uses the data to suit their own hypothesis, methodological malpractice relates to selection of out-dated protocols that are not suited to the intended work. Although these are usually unintentional, incidences of intentional manipulations have been reported to authors of this study. For example, carrying out investigations without positive controls; but including these from a previous study. Other methodological malpractices include unfair repetitions to gain statistical significance, or retrospective ethical approvals. In contrast, the publication related malpractices such as authorship malpractices, ethical clearance irregularities have also been reported. The findings also suggest a globalised approach with clear punitive measures for offenders is needed to tackle this problem. (shrink)

No consensus yet exists on how to handle incidental fnd-ings in human subjects research. Yet empirical studies document IFs in a wide range of research studies, where IFs are fndings beyond the aims of the study that are of potential health or reproductive importance to the individual research participant. This paper reports recommendations of a two-year project group funded by NIH to study how to manage IFs in genetic and genomic research, as well as imaging research. We conclude that researchers (...) have an obligation to address the possibility of discovering IFs in their protocol and communications with the IRB, and in their consent forms and communications with research participants. Researchers should establish a pathway for handling IFs and communicate that to the IRB and research participants. We recommend a pathway and categorize IFs into those that must be disclosed to research participants, those that may be disclosed, and those that should not be disclosed. (shrink)

Recreational Drugs European Network (ReDNet) project aims to use the Psychonaut Web Mapping Project database (Psychonaut Web Mapping Group, 2009) containing novel psychoactive compounds usually not mentioned in the scientific literature and thus unknown to clinicians as a unique source of information. The database will be used to develop an integrated ICT prevention approach targeted at vulnerable individuals and focused on novel synthetic and herbal compounds and combinations. Particular care will be taken in keeping the health professionals working directly with (...) young people showing problematic behaviors regularly updated in terms of novel compounds and combinations as well. A user-friendly project website will be developed aimed primarily at delivering the information/prevention approaches, but will also be a way of communicating with project partners and relevant stakeholders (e.g. thematic forum facilities, instant messages, blogs, video chat, wikiblog, newsletters distributed via mailing list). The website will support various ICT prevention tools, including an SMS alert service. Different areas and sections will be aimed specifically at the different target groups. -/- . (shrink)

Drawing on a landscape analysis of existing data-sharing initiatives, in-depth interviews with expert stakeholders, and public deliberations with community advisory panels across the U.S., we describe features of the evolving medical information commons. We identify participant-centricity and trustworthiness as the most important features of an MIC and discuss the implications for those seeking to create a sustainable, useful, and widely available collection of linked resources for research and other purposes.

ABSTRACTDifficulties with inhibiting fear have been associated with the emergence of anxiety problems and poor response to cognitive–behavioural treatment. Fear inhibition problems measured using experimental paradigms involving aversive stimuli may be inappropriate for vulnerable samples and may not capture fear inhibition problems evident in everyday life. We present the Fear Inhibition Questionnaire, a self-report measure of fear inhibition abilities. We assess the FIQ’s factor structure across two cultures and how well it correlates with fear inhibition indices derived experimentally. Adolescent participants (...) from Hong Kong and England completed the FIQ, with the English participants also completing a conditioning and extinction task to assess fear inhibition problems. Across both cultures, the FIQ showed a single factor structure and low FIQ scores, or worse fear inhibition problems, were associated with self-reports of heightened anxiety. Correlation of FIQ scores with experimental indices, whi... (shrink)

Mucopolysaccharidosis type I (MPS I) is a rare lysosomal storage disorder treated with bone marrow transplantation or enzyme replacement therapy with laronidase, a high-cost orphan drug. Laronidase was approved by the US Food and Drug Administration and the European Medicines Agency in 2003 and by the Brazilian National Health Surveillance Agency in 2005. Many Brazilian MPS I patients have been receiving laronidase despite the absence of a governmental policy regulating access to the drug. Epidemiological and treatment data concerning MPS I (...) are scarce. This study aims to present a demographic profile of Brazilian patients with MPS I, describe the routes of access to laronidase in Brazil, and discuss associated ethical issues relating to public funding of orphan drugs. (shrink)

Peter Abelard (1079–1142 ce) was the most wide‐ranging philosopher of the twelfth century. He quickly established himself as a leading teacher of logic in and near Paris shortly after 1100. After his affair with Heloise, and his subsequent castration, Abelard became a monk, but he returned to teaching in the Paris schools until 1140, when his work was condemned by a Church Council at Sens. His logical writings were based around discussion of the “Old Logic”: Porphyry's Isagoge, aristotle'S Categories and (...) On Interpretation and boethius'S textbook on topical inference. They comprise a freestanding Dialectica (“Logic”; probably c.1116), a set of commentaries (known as the Logica [Ingredientibus], c. 1119) and a later (c. 1125) commentary on the Isagoge (Logica Nostrorum Petititoni Sociorum or Glossulae). In a work Abelard called his Theologia, issued in three main versions (between 1120 and c.1134), he attempted a logical analysis of trinitarian relations and explored the philosophical problems surrounding God's claims to omnipotence and omniscience. The Collationes (“Debates,” also known as “Dialogue between a Christian, a Philosopher and a Jew”; probably c.1130) present a rational investigation into the nature of the highest good, in which the Christian and the Philosopher (who seems to be modeled on a philosopher of pagan antiquity) are remarkably in agreement. The unfinished Scito teipsum (“Know thyself,” also known as the “Ethics”; c.1138) analyses moral action. (shrink)

El presente artículo presenta los nuevos e importantes descubrimientos en la terraza litoral al pie del oasis de niebla, a partir de Noviembre de 2003, que junto a estudios anteriores conforman un cuadro general bastante completo de los patrones de asentamiento, modus vivendi, costumbres y actividades económicas de los antiguos pobladores costeros del norte de Chile, que reafirman la enorme importancia que adquirió el ecosistema de oasis de niebla costero en el género de vida, tipos de asentamiento y desplazamientos de (...) los cazadores-recolectores marinos del litoral norte. (shrink)

We study arithmetic and hyperarithmetic degrees of categoricity. We extend a result of E. Fokina, I. Kalimullin, and R. Miller to show that for every computable ordinal $\alpha$, $\mathbf{0}^{}$ is the degree of categoricity of some computable structure $\mathcal{A}$. We show additionally that for $\alpha$ a computable successor ordinal, every degree $2$-c.e. in and above $\mathbf{0}^{}$ is a degree of categoricity. We further prove that every degree of categoricity is hyperarithmetic and show that the index set of structures with degrees (...) of categoricity is $\Pi_{1}^{1}$-complete. (shrink)

Ethics for Enemies comprises three original philosophical essays on torture, terrorism, and war. F. M. Kamm deploys ethical theory in her challenging new treatments of these most controversial practical issues. First she considers the nature of torture and the various occasions on which it could occur, in order to determine why it might be wrong to torture a wrongdoer held captive, even if this were necessary to save his victims. In the second essay she considers what makes terrorism wrong--whether it (...) is the intention to harm civilians, rather than harm to them being 'collateral damage,' or something else--and whether terrorism is always wrong. The third essay discusses whether having a right reason, in the sense of a right intention, is necessary in order for a war to be just. Kamm then examines ways in which the harms of war can be proportional to the achievement of the just cause and other goods that war can bring about, so as to make the declaration of war permissible. (shrink)

The Rainbow Ramsey Theorem is essentially an "anti-Ramsey" theorem which states that certain types of colorings must be injective on a large subset (rather than constant on a large subset). Surprisingly, this version follows easily from Ramsey's Theorem, even in the weak system RCA₀ of reverse mathematics. We answer the question of the converse implication for pairs, showing that the Rainbow Ramsey Theorem for pairs is in fact strictly weaker than Ramsey's Theorem for pairs over RCA₀. The separation involves techniques (...) from the theory of randomness by showing that every 2-random bounds an ω-model of the Rainbow Ramsey Theorem for pairs. These results also provide as a corollary a new proof of Martin's theorem that the hyperimmune degrees have measure one. (shrink)

We investigate the complexity of isomorphisms of computable structures on cones in the Turing degrees. We show that, on a cone, every structure has a strong degree of categoricity, and that degree of categoricity is${\rm{\Delta }}_\alpha ^0 $-complete for someα. To prove this, we extend Montalbán’sη-system framework to deal with limit ordinals in a more general way. We also show that, for any fixed computable structure, there is an ordinalαand a cone in the Turing degrees such that the exact complexity (...) of computing an isomorphism between the given structure and another copy${\cal B}$in the cone is a c.e. degree in${\rm{\Delta }}_\alpha ^0\left$. In each of our theorems the cone in question is clearly described in the beginning of the proof, so it is easy to see how the theorems can be viewed as general theorems with certain effectiveness conditions. (shrink)

To reduce sex differences in employment outcomes, we must examine them in the context of the sex-gender hierarchy. The conventional explanation for wage gap—job segregation—is incorrect because it ignores men's incentive to preserve their advantages and their ability to do so by establishing the rules that distribute rewards. The primary method through which all dominant groups maintain their hegemony is by differentiating the subordinate group and defining it as inferior and hence meriting inferior treatment. My argument implies that neither sex-integrating (...) jobs nor implementing comparable worth will markedly improve women's employment status because men can subvert these mechanisms or even change the rules by which rewards are allocated. As evidence, I show that occupational integration has failed to advance women appreciably, and I argue that comparable worth is not likely to be much more effective. Instead, we must seek political analyses and political solutions. (shrink)

We analyze the degree spectra of structures in which different types of immunity conditions are encoded. In particular, we give an example of a structure whose degree spectrum coincides with the hyperimmune degrees. As a corollary, this shows the existence of an almost computable structure of which the complement of the degree spectrum is uncountable.

We consider the Turing degrees of prime models of complete decidable theories. In particular we show that every complete decidable atomic theory has a prime model whose elementary diagram is low. We combine the construction used in the proof with other constructions to show that complete decidable atomic theories have low prime models with added properties. If we have a complete decidable atomic theory with all types of the theory computable, we show that for every degree d with 0 0, (...) T has a d-decidable model omitting the nonprincipal types listed by L. (shrink)