Background There are several psychosocial and ethical issues surrounding the decision to be a living kidney donor. The present study aimed to determine the perceptions of psychosocial and ethical issues that living kidney donors may have, and analyze their psychological characteristics.Methods Face-to-face semi-structured interviews were conducted with 15 donors. Thematic analysis was then performed to categorize the thematic elements of the transcripts. All procedures were approved by the relevant review board.Results Four main categories were identified: Awareness of family dynamics, barriers (...) to a proper understanding, contrasting psychological effects of recipient presence in clinical practice, insufficient information explained in informed consent.Conclusion Donors felt that they took on the “role as a care giver” for the recipient and were less aware of themselves as patients. This is a new concept that has not been shown in previous studies. Donors exist within the recipient and family, and the range of their autonomy may go beyond the traditional concept of autonomy and be rooted in relational autonomy. This study suggested that medical treatment in the presence of the recipient promotes the relational autonomy of the donor. (shrink)

Informed consent is considered by many to be a moral imperative in medical research. However, it is increasingly acknowledged that in many actual instances of consent to participation in medical research, participants do not employ the provided information in their decision to consent, but rather consent based on the trust they hold in the researcher or research enterprise. In this article we explore whether trust-based consent is morally inferior to information-based consent. We analyse the moral values essential to valid consent (...) – autonomy, voluntariness, non-manipulation, and non-exploitation – and assess whether these values are less protected and promoted by consent based on trust than they are by consent based on information. We find that this is not the case, and thus conclude that trust-based consent if not morally inferior to information-based consent. (shrink)

In this paper, we discuss guidelines for a reward design problem that defines when and what amount of reward should be given to the agent/s, within the context of reinforcement learning approach. We would like to take keepaway soccer as a standard task of the multiagent domain which requires skilled teamwork. The difficulties of designing reward for this task are due to its features as follows: i) since it belongs to the continuing task which has no explicit goal to achieve, (...) it is hard to tell when reward should be given to the agent/s. ii) since it is a multiagent cooperative task, it is hard to decide what is a fair share of reward for each agent's contribution to achieve the goal. Through some experiments, we show that the reward design have a major effect on the agent's behavior, and introduce the successful reward function that makes agents perform keepaway better and more interesting than the conventional one does. Finally, we explore the relationship between `reward design' and `acquired behaviors' from the viewpoint of teamwork. (shrink)

In this paper we formulate epsilon substitution method for a theory $\Pi _{2}^{0}$-FIX for non-monotonic $\Pi _{2}^{0}$ inductive definitions. Then we give a termination proof of the H-processes based on Ackermann [1].

This paper investigates a distributed coordination control for a class of high-order uncertain multiagent systems. Under the framework of iterative learning control, a novel fully distributed learning protocol is devised for the coordination problem of MASs including time-varying parameter uncertainties as well as actuator saturations. Meanwhile, the learning updating laws of various parameters are proposed. Utilizing Lyapunov theory and combining with Graph theory, the proposed algorithm can make each follower track a leader completely over a limited time interval even though (...) each follower is without knowing the dynamics of the leader. Moreover, the extension to formation control is made. The validity and feasibility of the algorithm are verified conclusively by two examples. (shrink)

Background: Individual, comprehensive, and written informed consent is broadly considered an ethical obligation in research involving the sampling of human material. In developing countries, however, local conditions, such as widespread illiteracy, low levels of education, and hierarchical social structures, complicate compliance with these standards. As a result, researchers may modify the consent process to secure participation. To evaluate the ethical status of such modified consent strategies it is necessary to assess the extent to which local practices accord with the values (...) underlying informed consent. Methods: Over a 2-week period in April 2014 we conducted semistructured interviews with researchers from a genetic research institute in rural Pakistan and families who had given blood samples for their research. Interviews with researchers focused on the institute’s requirements for consent, and the researchers’ strategies for and experiences with obtaining consent in the field. Interviews with donors focused on their motivation for donating samples, their experience of consent and donation, and what factors were central in their decisions to give consent. Results: Researchers often reported modifications to consent procedures suited to the local context, standardly employing oral and elder consent, and tailoring information to the social education level of donor families. Central themes in donors’ accounts of their decision to consent were the hope of getting something out of their participation and their remarkably high levels of trust in the researchers. Several donor accounts indicated a degree of confusion about participation and diagnosis, resulting in misconceived expectations of therapeutic benefits. Conclusions: We argue that while building and maintaining trusting relationships in research is important—not least in developing countries—strategies that serve this endeavor should be supplemented with efforts to ensure proper provision and understanding of relevant information, specifically about the nature of research and measures for individual consent and opt-out. (shrink)

The method of analytic tableaux is employed in many introductory texts and has also been used quite extensively as a basis for automated theorem proving. In this paper, we discuss the complexity of the system as a method for refuting contradictory sets of clauses, and resolve several open questions. We discuss the three forms of analytic tableaux: clausal tableaux, generalized clausal tableaux, and binary tableaux. We resolve the relative complexity of these three forms of tableaux proofs and also resolve the (...) relative complexity of analytic tableaux versus resolution. We show that there is a quasi-polynomial simulation of tree resolution by analytic tableaux; this simulation is close to optimal, since we give a matching lower bound that is tight to within a polynomial. (shrink)

In this paper we formulate epsilon substitution method for a theory $\Pi _{2}^{0}$-FIX for non-monotonic $\Pi _{2}^{0}$ inductive definitions. Then we give a termination proof of the H-processes based on Ackermann [1].

On the philosophy of integral education as an alternative educational process as followed in India.

Research In Mathematics Education In Australasia 2016–2019 (sometimes shortened to RiMEA 2016–2019) is a timely and important edited collection where contributors provide critical reviews on mathem...

Hilbert proposed the epsilon substitution method as a basis for consistency proofs. Hilbert's Ansatz for finding a solving substitution for any given finite set of transfinite axioms is, starting with the null substitution S0, to correct false values step by step and thereby generate the process S0,S1,… . The problem is to show that the approximating process terminates. After Gentzen's innovation, Ackermann 162) succeeded to prove termination of the process for first order arithmetic. Inspired by G. Mints as an Ariadne's (...) thread we formulate the epsilon substitution method for the theory ID1 of non-iterated inductive definitions for disjunctions of simply universal and existential operators, and give a termination proof of the H-process based on Ackermann 162). The termination proof is based on transfinite induction up to the Howard ordinal. (shrink)

This paper deals with a proof theory for a theory T22 of recursively Mahlo ordinals in the form of Π2-reflecting on Π2-reflecting ordinals using a subsystem Od of the system O of ordinal diagrams in Arai 353). This paper is the first published one in which a proof-theoretic analysis à la Gentzen–Takeuti of recursively large ordinals is expounded.

Previous research reported that in processing structurally ambiguous sentences comprehenders often preserve an initial incorrect analysis even after adopting a correct analysis following structural disambiguation. One criticism is that the sentences tested in previous studies involved referential ambiguity and allowed comprehenders to make inferences about the initial interpretation using pragmatic information, suggesting the possibility that the initial analysis persisted due to comprehenders' pragmatic inference but not to their failure to perform complete reanalysis of the initial misanalysis. Our study investigated this (...) by testing locally ambiguous relative clause sentences in Japanese, in which the initial misinterpretation contradicts the correct interpretation. Our study using a self-paced reading technique demonstrated evidence for the persistence of the initial analysis with this structure. The results from an eye-tracking study further suggested that the phenomenon directly reflected the amount of support given to the initial incorrect analysis prior to disambiguating information: The more supported the incorrect main clause analysis was, the more likely comprehenders were to preserve the analysis even after the analysis was falsified. Our results thus demonstrated that the preservation of the initial analysis occurs not due to referential ambiguities but to comprehenders' difficulty to fully revise the highly supported initial interpretation. (shrink)

This paper deals with a proof theory for a theory T3 of Π3-reflecting ordinals using the system O of ordinal diagrams in Arai 1375). This is a sequel to the previous one 1) in which a theory for recursively Mahlo ordinals is analyzed proof-theoretically.

In this, journal, W. Buchholz gave an elegant proof of a characterization theorem for provably total recursive functions in the theory IDv for the v-times iterated inductive definitions . He characterizes the classes of functions by Hardy functions. In this note we will show that a slow growing analogue to the theorem can be obtained by a slight modification of Buchholz' proof.

We formulate epsilon substitution method for theories (H)α0 of absolute jump hierarchies, and give two termination proofs of the H-process: The first proof is an adaption of Mints M, Mints-Tupailo-Buchholz MTB, i.e., based on a cut-elimination of a specially devised infinitary calculus. The second one is an adaption of Ackermann Ack. Each termination proof is based on transfinite induction up to an ordinal θ(α0+ ω)0, which is best possible.

We gather the following miscellaneous results in proof theory from the attic.1. 1. A provably well-founded elementary ordering admits an elementary order preserving map.2. 2. A simple proof of an elementary bound for cut elimination in propositional calculus and its applications to separation problem in relativized bounded arithmetic below S21.3. 3. Equivalents for Bar Induction, e.g., reflection schema for ω logic.4. 4. Direct computations in an equational calculus PRE and a decidability problem for provable inequations in PRE.5. 5. Intuitionistic fixed (...) point theories which are conservative extensions of HA.6. 6. Proof theoretic strengths of classical fixed points theories.7. 7. An equivalence between transfinite induction rule and iterated reflection schema over IΣn.8. 8. Derivation lengths of finite rewrite rules reducing under lexicographic path orders and multiply recursive functions.Each section can be read separately in principle. (shrink)

In this note the well-ordering principle for the derivative \ of normal functions \ on ordinals is shown to be equivalent to the existence of arbitrarily large countable coded \-models of the well-ordering principle for the function \.

In this paper we introduce a recursive notation system $O(\mu)$ of ordinals. An element of the notation system is called an ordinal diagram following G. Takeuti [25]. The system is designed for proof theoretic study of theories of recursively Mahlo universes. We show that for each $\alpha<\Omega$ in $O(\mu)$ KPM proves that the initial segment of $O(\mu)$ determined by $\alpha$ is a well ordering. Proof theoretic study for such theories will be reported in [9].

In this paper, we prove the wellfoundedness of recursive notation systems for reflecting ordinals up to Π₃-reflection by relevant inductive definitions.

We show that the existence of a weakly compact cardinal over the Zermelo–Fraenkel's set theory ZF is proof-theoretically reducible to iterations of Mostowski collapsings and Mahlo operations.

In this paper we introduce a recursive notation system O(Π 3 ) of ordinals. An element of the notation system is called an ordinal diagram. The system is designed for proof theoretic study of theories of Π 3 -reflection. We show that for each $\alpha in O(Π 3 ) a set theory KP Π 3 for Π 3 -reflection proves that the initial segment of O(Π 3 ) determined by α is a well ordering. Proof theoretic study for such theories (...) will be reported in [4]. (shrink)

We show that the consistency of the first order arithmetic $PA$ follows from the pointwise induction up to the Howard ordinal. Our proof differs from U. Schmerl [Sc]: We do not need Girard's Hierarchy Comparison Theorem. A modification on the ordinal assignment to proofs by Gentzen and Takeuti [T] is made so that one step reduction on proofs exactly corresponds to the stepping down $\alpha\mapsto\alpha [1]$ in ordinals. Also a generalization to theories $ID_q$ of finitely iterated inductive definitions is proved.