This article reports on a collective effort to position ethics policies within the context of a specific discipline – Applied Language Studies (ALS). Through a discussion of challenges to ALS-specific pedagogical and research practices, this article highlights (1) the need for consistency across institutional Research Ethics Boards in the application of general principles of ethics review, and (2) the recognition of local considerations that are informed by disciplinary approaches not envisioned in current ethics policies. Ethics policies that are driven by (...) substantive ethical intent will recognize pedagogical practices, research methodologies, and epistemological values and traditions that mark a discipline. (shrink)
Conscience and Conscientious Objection of Health Care Professionals Refocusing the Issue Content Type Journal Article Pages 351-364 DOI 10.1007/s10730-009-9113-x Authors Natasha T. Morton, The University of Western Ontario Ontario Canada N6A 5B9 Kenneth W. Kirkwood, Arthur and Sonia Labatt Health Sciences Building London Ontario Canada N6A 5B9 Journal HEC Forum Online ISSN 1572-8498 Print ISSN 0956-2737 Journal Volume Volume 21 Journal Issue Volume 21, Number 4.
Now suppose that Joey responds by uttering the exact same words back to Natasha: “I am right and you are wrong”. He has said the same words, with the same meaning, but he has not said the same thing. Joey’s utterance of “I” designates Joey and his utterance of “you” designates Natasha. The truthconditions of his statement are that Joey is right and Natasha is wrong. Joey has directly disagreed with Natasha.
Agents which perform inferences on the basis of unreliable information need an ability to revise their beliefs if they discover an inconsistency. Such a belief revision algorithm ideally should be rational, should respect any preference ordering over the agent’s beliefs (removing less preferred beliefs where possible) and should be fast. However, while standard approaches to rational belief revision for classical reasoners allow preferences to be taken into account, they typically have quite high complexity. In this paper, we consider belief revision (...) for agents which reason in a simpler logic than full first-order logic, namely rule-based reasoners. We show that it is possible to define a contraction operation for rule-based reasoners, which we call McAllester contraction, which satisfies all the basic Alchourrón, Gärdenfors and Makinson (AGM) postulates for contraction (apart from the recovery postulate) and at the same time can be computed in polynomial time. We prove a representation theorem for McAllester contraction with respect to the basic AGM postulates (minus recovery), and two additional postulates. We then show that our contraction operation removes a set of beliefs which is least preferred, with respect to a natural interpretation of preference. Finally, we show how McAllester contraction can be used to define a revision operation which is also polynomial time, and prove a representation theorem for the revision operation. (shrink)
We present a framework for verifying systems composed of heterogeneous reasoning agents, in which each agent may have differing knowledge and inferential capabilities, and where the resources each agent is prepared to commit to a goal (time, memory and communication bandwidth) are bounded. The framework allows us to investigate, for example, whether a goal can be achieved if a particular agent, perhaps possessing key information or inferential capabilities, is unable (or unwilling) to contribute more than a given portion of its (...) available computational resources or bandwidth to the problem. We present a novel temporal epistemic logic, BMCL-CTL , which allows us to describe a set of reasoning agents with bounds on time, memory and the number of messages they can exchange. The bounds on memory and communication are expressed as axioms in the logic. As an example, we show how to axiomatise a system of agents which reason using resolution and prove that the resulting logic is sound and complete. We then show how to encode a simple system of reasoning agents specified in BMCL-CTL in the description language of the Mocha model checker (Alur et al., Proceedings of the tenth international conference on computer-aided verification (CAV) , 1998), and verify that the agents can achieve a goal only if they are prepared to commit certain time, memory and communication resources. (shrink)
There exists a considerable body of work on epistemic logics for resource-bounded reasoners. In this paper, we concentrate on a less studied aspect of resource-bounded reasoning, namely, on the ascription of beliefs and inference rules by the agents to each other. We present a formal model of a system of bounded reasoners which reason about each other’s beliefs, and investigate the problem of belief ascription in a resource-bounded setting. We show that for agents whose computational resources and memory are bounded, (...) correct ascription of beliefs cannot be guaranteed, even in the limit. We propose a solution to the problem of correct belief ascription for feasible agents which involves ascribing reasoning strategies , or preferences on formulas, to other agents, and show that if a resource-bounded agent knows the reasoning strategy of another agent, then its ascription of beliefs to the other agent is correct in the limit. (shrink)
The effective reasoning capability of an agent can be defined as its capability to infer, within a given space and time bound, facts that are logical consequences of its knowledge base. In this paper we show how to determine the effective reasoning capability of an agent with limited memory by encoding the agent as a transition system and automatically verifying whether a state where the agent believes a certain conclusion is reachable from the start state. We present experimental results using (...) the Model Based Planner (MBP) which illustrates how the length of the deduction varies for different memory sizes. (shrink)
We define bisimulations for temporal logic with Since and Until. This new notion is compared to existing notions of bisimulations, and then used to develop the basic model theory of temporal logic with Since and Until. Our results concern both invariance and definability. We conclude with a brief discussion of the wider applicability of our ideas.
This paper establishes a connection between structure sensitive categorial inference and classical modal logic. The embedding theorems for non-associative Lambek Calculus and the whole class of its weak Sahlqvist extensions demonstrate that various resource sensitive regimes can be modelled within the framework of unimodal temporal logic. On the semantic side, this requires decomposition of the ternary accessibility relation to provide its correlation with standard binary Kripke frames and models.
The question of if, and under what conditions transsexuals should be allowed to participate in sports in their acquired sex is becoming increasingly relevant partly because the number of transsexuals is increasing partly because many countries now provide mechanisms for achieving legal recognition as belonging to the new acquired sex. This paper develops (1) an analysis of the justification for maintaining sex segregation in some sports and (2) an account of the rights of transsexuals to be recognised in their new (...) sex. On the basis of these two analyses it critically evaluates two set of rules for the participation of transsexuals in elite sports: the UK guidelines issued in pursuance of the Gender Recognition Act 2004 and the International Olympic Committee's guidelines. It is argued that these guidelines are conflicting and that a modified set of criteria is more justifiable. (shrink)
Practical reasoners are resource-bounded—in particular they require time to derive consequences of their knowledge. Building on the Timed Reasoning Logics (TRL) framework introduced in [1], we show how to represent the time required by an agent to reach a given conclusion. TRL allows us to model the kinds of rule application and conflict resolution strategies commonly found in rule-based agents, and we show how the choice of strategy can influence the information an agent can take into account when making decisions (...) at a particular point in time. We prove general completeness and decidability results for TRL, and analyse the impact of communication in an example system consisting of two agents which use different conflict resolution strategies. (shrink)
Van Lambalgen (1990) proposed a translation from a language containing a generalized quantifierQ into a first-order language enriched with a family of predicatesR i, for every arityi (or an infinitary predicateR) which takesQxg(x, y1,..., yn) to x(R(x, y1,..., y1) (x,y1,...,yn)) (y 1,...,yn are precisely the free variables ofQx). The logic ofQ (without ordinary quantifiers) corresponds therefore to the fragment of first-order logic which contains only specially restricted quantification. We prove that it is decidable using the method of analytic tableaux. Related (...) results were obtained by Andréka and Németi (1994) using the methods of algebraic logic. (shrink)
We show how sequent calculi for some generalized quantifiers can be obtained by generalizing the Herbrand approach to ordinary first order proof theory. Typical of the Herbrand approach, as compared to plain sequent calculus, is increased control over relations of dependence between variables. In the case of generalized quantifiers, explicit attention to relations of dependence becomes indispensible for setting up proof systems. It is shown that this can be done by turning variables into structured objects, governed by various types of (...) structural rules. These structured variables are interpreted semantically by means of a dependence relation. This relation is an analogue of the accessibility relation in modal logic. We then isolate a class of axioms for generalized quantifiers which correspond to first-order conditions on the dependence relation. (shrink)
Natasha Mitchell: This is All in the Mind on Radio National abc.net.au/rn I'm Natasha Mitchell and really this past fortnight has been hellish for Australia, the bushfires in Victoria have claimed hundreds of human lives and it's almost been impossible to comprehend the scale of the disaster. Today's show links in a small way to the debate now being waged over what, or who, causes bushfires. It's a discussion about the philosophy of intentions and their profound (...) moral weight. (shrink)
This paper investigates when it is possible for a partial ordering P to force Pκ(λ) \ V to be stationary in VP. It follows from a result of Gitik that whenever P adds a new real, then Pκ(λ) \ V is stationary in VP for each regular uncountable cardinal κ in VP and all cardinals λ > κ in VP [4]. However, a covering theorem of Magidor implies that when no new ω-sequences are added, large cardinals become necessary [7]. The (...) following is equiconsistent with a proper class of ω₁-Erdős cardinals: If P is N₁-Cohen forcing, then Pκ(λ) \ V is stationary in VP, for all regular κ ≥ N₂ and all λ > κ. The following is equiconsistent with an ω₁-Erdős cardinal: If P is N₁-Cohen forcing, then PN₂ (N₃) \ V is stationary in VP. The following is equiconsistent with κ measurable cardinals: If P is κ-Cohen forcing, then Pκ + (Nκ \ V is stationary in VP. (shrink)
We consider a predicate logic Lfd where not all assignments of values to individual variables are possible. Some variables are functionally dependent on other variables. This makes sense if the models of logic are assumed to correspond to databases or states. We show that Lfd is undecidable but has a complete and sound sequent calculus formalisation.
(2012). Modal logics for reasoning about infinite unions and intersections of binary relations. Journal of Applied Non-Classical Logics: Vol. 22, No. 4, pp. 275-294. doi: 10.1080/11663081.2012.705960.
A Turing degree a is said to be almost everywhere dominating if, for almost all $X \in 2^{\omega}$ with respect to the "fair coin" probability measure on $2^{\omega}$ , and for all g: $\omega \rightarrow \omega$ Turing reducible to X, there exists f: $\omega \rightarrow \omega$ of Turing degree a which dominates g. We study the problem of characterizing the almost everywhere dominating Turing degrees and other, similarly defined classes of Turing degrees. We relate this problem to some questions in (...) the reverse mathematics of measure theory. (shrink)
If we are willing to accept that a large part of our shared knowledge of the world includes engineering knowledge, then we can conclude that a lot of our sophisticated knowledge is steadfast; that it has been, and will continue to be, developed and improved upon.
We propose a framework for modelling situated resource-bounded agents. The framework is based on an objective ascription of intentional modalities and can be easily tailored to the system we want to model and the properties we wish to specify. As an elaboration of the framework, we introduce a logic, OBA, for describing the observations, beliefs, goals and actions of simple agents, and show that OBA is complete, decidable and has an efficient model checking procedure, allowing properties of agents specified in (...) OBA to be verified using standard theorem proving or model checking techniques. (shrink)
This paper examines the long dialogue between Africana phenomenology and Africana feminism. In particular, it examines the exchanges between WEB Du Bois, Frantz Fanon, Lewis Gordon and Sylvia Wynter on the one hand, and a number of black feminists on the other, including bell hooks, Natasha Barnes, Farrah Griffin, and Joy James. The primary outcome of the survey of these exchanges is that the pro-feminist spaces created by black male phenomenologists have all been insufficient for the full representation of (...) the black female voice. In the words of Sylvia Wynter, such a full representation can only come through "a feminism in its own name". (shrink)
(2013). Open Access Digital Data Sharing: Principles, Policies and Practices☆. Social Epistemology: Vol. 27, No. 1, pp. 47-67. doi: 10.1080/02691728.2012.760663.
This paper explores industry-level, collective stakeholder action. It argues that when industry stakeholders perceive change to be radically in conflict with their shared beliefs, this motivates them to act collectively at the industry level. The introduction of Cardhu pure malt in the Scotch whisky industry is used here as an illustrative example.
Electronic surveillance of employees in the workplace presents both opportunities and risks to contemporary managers. Some of the moral risks associated with electronic workplace surveillance are well-known and discussed in the literature. A lesser-known risk, which is explored and addressed in this article, is the threat that electronic surveillance poses, when used inappropriately, to employees’ personal autonomy. This article elaborates the concept of personal autonomy, illustrates how electronic workplace surveillance might be used to violate personal autonomy, and suggests some management (...) strategies that could be used to avoid such violations. (shrink)
The aim of this paper is to explore the roles of religion and culture in how firm-stakeholder relationships evolve and are managed. It uses an ‘embeddedness’ framework (Granovetter, 1983; Uzzi, 1997, 2003) as its theoretical frame of reference to study how and why culture and religion can influence the varying types of ties that constitute firmstakeholder relationships.
The development of the Universal Declaration of Ethical Principles for Psychologists has sparked debate about its applicability to cultural groups around the globe. Focusing on the principle of respect espoused in the Declaration, this article uses examples largely drawn from the indigenous Ma-ori culture of Aotearoa/New Zealand, to highlight how the ethical imperatives espoused by the Declaration may conflict with the perspectives of M?ori. A discussion of actions denoting respect is given from a M?ori perspective. Distinctions between the ethical expectations (...) the discipline of psychology and Ma-ori have of psychological practitioners are also addressed. (shrink)
