A set Asubset of or equal toω is called computably enumerable , if there is an algorithm to enumerate the elements of it. For sets A,Bsubset of or equal toω, we say that A is bounded Turing reducible to reducible to) B if there is a Turing functional, Φ say, with a computable bound of oracle query bits such that A is computed by Φ equipped with an oracle B, written image. Let image be the structure of the c.e. bT-degrees, (...) the c.e. degrees under the bounded Turing reductions. In this paper we study the continuity properties in image. We show that for any c.e. bT-degree image, there is a c.e. bT-degree image such that for any c.e. bT-degree image, image if and only if image. We prove that the analog of the Seetapun local noncappability theorem from the c.e. Turing degrees also holds in image. This theorem demonstrates that every image is noncappable with any nontrivial degree below some image. (shrink)

We show that every nonzero $\Delta _{2}^{0}$ e-degree bounds a minimal pair. On the other hand, there exist $\Sigma _{2}^{0}$ e-degrees which bound no minimal pair.

We prove that for any computably enumerable degree c, if it is cappable in the computably enumerable degrees, then there is a d.c.e. degree d such that c d = 0′ and c ∩ d = 0. Consequently, a computably enumerable degree is cappable if and only if it can be complemented by a nonzero d.c.e. degree. This gives a new characterization of the cappable degrees.

It is shown that there exists a low2 Harrington non-splitting base-that is, a low2 computably enumerable (c.e.) degree a such that for any c.e. degrees x, y, if $0' = x \vee y$ , then either $0' = x \vee a$ or $0' = y \vee a$ . Contrary to prior expectations, the standard Harrington non-splitting construction is incompatible with the $low_{2}-ness$ requirements to be satisfied, and the proof given involves new techniques with potentially wider application.

Lachlan observed that any nonzero d.c.e. degree bounds a nonzero c.e. degree. In this paper, we study the c.e. predecessors of d.c.e. degrees, and prove that given a nonzero d.c.e. degree , there is a c.e. degree below and a high d.c.e. degree such that bounds all the c.e. degrees below . This result gives a unified approach to some seemingly unrelated results. In particular, it has the following two known theorems as corollaries: there is a low c.e. degree isolating (...) a high d.c.e. degree [S. Ishmukhametov, G. Wu, Isolation and the high/low hierarchy, Arch. Math. Logic 41 259–266]; there is a high d.c.e. degree bounding no minimal pairs [C.T. Chong, A. Li, Y. Yang, The existence of high nonbounding degrees in the difference hierarchy, Ann. Pure Appl. Logic 138 31–51]. (shrink)

We say that a computably enumerable (c.e.) degree b is a Lachlan nonsplitting base (LNB), if there is a computably enumerable degree a such that a > b, and for any c.e. degrees w,v ≤ a, if a ≤ w or; v or; b then either a ≤ w or; b or a ≤ v or; b. In this paper we investigate the relationship between bounding and nonbounding of Lachlan nonsplitting bases and the high /low hierarchy. We prove that there (...) is a non-Low2 c.e. degree which bounds no Lachlan nonsplitting base. (shrink)

In this paper, we first prove that there exist computably enumerable (c.e.) degrees a and b such that ${\bf a\not\leq b}$ , and for any c.e. degree u, if ${\bf u\leq a}$ and u is cappable, then ${\bf u\leq b}$ , so refuting a conjecture of Lempp (in Slaman [1996]); secondly, we prove that: (A. Li and D. Wang) there is no uniform construction to build nonzero cappable degree below a nonzero c.e. degree, that is, there is no computable function (...) $f$ such that for all $e\in\omega,$ (i) $W_{f(e)}\leq_{\rm T}W_e$ , (ii) $W_{f(e)}$ has a cappable degree, and (iii) $W_{f(e)}\not\leq_{\rm T}\emptyset$ unless $W_e\leq_{\rm T}\emptyset.$. (shrink)

A computably enumerable degree a is called nonbounding, if it bounds no minimal pair, and plus cupping, if every nonzero c.e. degree x below a is cuppable. Let NB and PC be the sets of all nonbounding and plus cupping c.e. degrees, respectively. Both NB and PC are well understood, but it has not been possible so far to distinguish between the two classes. In the present paper, we investigate the relationship between the classes NB and PC, and show that (...) there exists a minimal pair which join to a plus cupping degree, so that PC ⊈ NB. This gives a first known difference between NB and PC. (shrink)

It will be shown that there exist computably enumerable degrees a and b such that a $>$ b, and for any computably enumerable degree u, if u $\leq$ a and u is cappable, then u $<$ b.

In this paper, we prove that there exist computably enumerable degrees a and b such that $\mathbf{a} > \mathbf{b}$ and for any degree x, if x ≤ a and x is a minimal degree, then $\mathbf{x}.

We say that a computably enumerable (c. e.) degree a is plus-cupping, if for every c.e. degree x with $0 < x \leq a$ , there is a c. e. degree $y \not= 0'$ such that $x \vee y = 0/\'$ . We say that a is n-plus-cupping. if for every c. e. degree x, if $0 < x \leq a$ , then there is a $low_n$ c. e. degree 1 such that $x \vee l = 0'$ . Let PC (...) and $PC_n$ be the set of all plus-cupping, and n-plus-cupping c. e. degrees respectively. Then $PC_{1} \subseteq PC_{2} \subseteq PC_3 = PC$ . In this paper we show that $PC_{1} \subset PC_2$ , so giving a nontrivial hierarchy for the plus cupping degrees. The theorem also extends the result of Li, Wu and Zhang [14] showing that $LC_{1} \subset LC_2$ , as well as extending the Harrington plus-cupping theorem [8]. (shrink)

We study the jump hierarchy of d.c.e. Turing degrees and show that there exists a high d.c.e. degree d which does not bound any minimal pair of d.c.e. degrees.

We show that every nonzero Δ20, e-degree bounds a minimal pair. On the other hand, there exist Σ20, e-degrees which bound no minimal pair.

The Major Sub-degree Problem of A. H. Lachlan (first posed in 1967) has become a long-standing open question concerning the structure of the computably enumerable (c.e.) degrees. Its solution has important implications for Turing definability and for the ongoing programme of fully characterising the theory of the c.e. Turing degrees. A c.e. degree a is a major subdegree of a c.e. degree b > a if for any c.e. degree x, ${{\bf 0' = b \lor x}}$ if and only if (...) ${{\bf 0' = a \lor x}}$ . In this paper, we show that every c.e. degree b ≠ 0 or 0′ has a major sub-degree, answering Lachlan’s question affirmatively. (shrink)

We show that for any computably enumerable set A and any equation image set L, if L is low and equation image, then there is a c.e. splitting equation image such that equation image. In Particular, if L is low and n-c.e., then equation image is n-c.e. and hence there is no low maximal n-c.e. degree.

We give a corrected proof of an extension of the Robinson Splitting Theorem for the d. c. e. degrees.

"Co-publication agreement between China Social Sciences Press (China) and Paths International Ltd (UK)"--Colophon.

In this volume, leading scholars in Asian and comparative philosophy take the work of Joel J. Kupperman as a point of departure to consider new perspectives on Confucian ethics. Kupperman is one of the few eminent Western philosophers to have integrated Asian philosophical traditions into his thought, developing a character-based ethics synthesizing Western, Chinese, and Indian philosophies. With their focus on Confucian ethics, contributors respond, expand, and engage in critical dialogue with Kupperman’s views. Kupperman joins the conversation with responses and (...) comments that conclude the volume. (shrink)

本书以美国的价值哲学理论为依据,就其理论核心“价值本质论”,分析其价值本质的特色,揭示其本质论的根本缺陷等问题。.

A major controversy in the study of the "Analects" has been over the relation between two central concepts, ren (humanity, human excellence) and li (rites, rituals of propriety). Confucius seems to have said inconsistent things about this relation. Some passages appear to suggest that ren is more fundamental than li, while others seem to imply the contrary. It is therefore not surprising that there have been different interpretations and characterizations of this relation. Using the analogy of language grammar and mastery (...) of a language, it is proposed here that we should understand li as a cultural grammar and ren as the mastery of a culture. In this account, society cultivates its members through li toward the goal of ren, and persons of ren manifest their human excellence through their practice of li. (shrink)

本书探究了李宗吾的家族渊源、学识流派以及思想体系,试图全面解读“厚黑教主”,在读者面前展现出一个真实、全面的李宗吾。.

本书内容包括:从康德的“道德宗教”论儒家的宗教性、重评张载由“气化论”证立的成德论、从历史中提取智慧、当今越南的宗教与社会等。.

本书收录了著名学者李石岑先生的15篇讲演,涉及怀疑与信仰、哲学与人生、佛学与人生、教育与人生等哲学与生命论题。.

本书主要记述作者赴欧盟国家考察法律制度的感受心得,收《权利,权利》、《丹麦的平民政治》、《风雨柏林墙》等40多篇文章。.

本书研究了西方各国科学哲学思想的源流、派别,以及各派思想之间的关系及与科学、宗教、社会思潮的牵连,探索了科学哲学思想的发展方向。.

书中介绍了国内外护理伦理学的历史与现状,阐述了护理道德的基本原则、规范和范畴及护理道德、教育、评价的意义及方法等。.

本书共收入论文41篇,分为:社会主义伦理思想与道德实践研究、青年修养、职业道德等5部分。.

Emotions are now considered critical elements of a successful education. In English as a Foreign Language context, there are many challenges for teachers to deal with. Hence, it is necessary to take their emotions into consideration. Despite many studies in this area, researching teachers’ positive mood, hope, and academic buoyancy has been left less attended. Trying to introduce this line, the present study reviewed the definitions, related concepts, theories, and previous studies done on these three variables in detail. It also (...) touched upon the origins of researching emotion in educational contexts describing different schools of psychology. Additionally, the study offered some practical implications for EFL teachers, students, policy-makers, teacher trainers, and researchers. Finally, it enumerated the existing gaps in this area and made a number of research suggestions for future research. (shrink)

Research has independently highlighted the roles of semantic memory and associative abilities in creative thinking. However, it remains unclear how these two capacities relate to each other, nor ho...

Student–teacher relationships have been examined by many studies. However, an omission still exists, the existing scales are not appropriate for studying STRs in private colleges because of the special character of these schools. This paper presents the development and validation of Private-College Student–Teacher Relationship Scale, the first instrument to evaluate student–teacher relationships in private colleges. The PCSTRS has six dimensions: trust, interaction, intimacy, care, approval, and comfort. In our main study, the validity and reliability of the six-factor PCSTRS model were (...) demonstrated. The result of internal consistency coefficient indicated the high reliability of the scale, and the result of concurrent validity indicated the significant correlational relationships between the PCSTRS with other STR measures. In supplementary study, the PCSTRS was administered to 360 participants to confirm the applicability of PCSTRS and investigate the relation of STRs and students’ traits, performance, and wellbeing, as well as the differences between the private school and the public school in this relation; the analyses revealed that there were significant differences in trust, intimacy, and care between private and public colleges; positive correlations were found between STRs and self-esteem, self-efficacy, academic performance, extracurricular activity involvement, and subjective wellbeing. Present research firstly develops the PCSTRS, examined the reliability and validity, and provides the proposed nomological network among related constructs. (shrink)

Academic mothers perform intersected roles. They carry out their profession in workplaces, while they take the “second shift” of motherhood back to their families. The contested expectations in family and career built by the heterosexual matrix cause tension to academic mothers. We qualitatively investigate the interview data of six Chinese women academics on how they perform to negotiate their motherhood and academic work in the context of Chinese higher education, driven by the Butlerian theoretical concept of the heterosexual matrix. The (...) findings suggest that Chinese academic mothers play a zero-sum game between being mothers and being academics, deriving from their ontological responsibilities of motherhood. We conclude that in the masculine academia, these women academics help maintain the heterosexual matrix by satisfying the gender normativity when they negotiate their performances in their family and career; meanwhile, most have developed some strategies to achieve their career advancement. (shrink)

The renormalization group has been characterized as merely a coarse-graining procedure that does not illuminate the microscopic content of quantum field theory, but merely gets us from that content, as given by axiomatic QFT, to macroscopic predictions. I argue that in the constructive field theory tradition, RG techniques do illuminate the microscopic dynamics of a QFT, which are not automatically given by axiomatic QFT. RG techniques in constructive field theory are also rigorous, so one cannot object to their foundational import (...) on grounds of lack of rigor. (shrink)

Abusive supervision, defined as subordinates’ perception of the extent to which supervisors engage in the sustained display of hostile verbal and non-verbal behaviors, excluding physical contact, is associated with various negative outcomes. This has made it easy for researchers to overlook the possibility that some supervisors regret their bad behavior and express remorse for their actions. Hence, we know little about how subordinates react to the perception that their supervisor is remorseful and how this perception affects the outcomes of supervisors’ (...) undesired behavior. Specifically, drawing on the social exchange theory and displace revenge literature, this study explains how abusive supervision leads to victims’ service sabotage behavior. In addition, this study also investigates how perceived supervisors’ remorse mitigates the adverse effects of abusive supervision. Based on time-lagged, dyadic data from Chinese individuals, this study found support for all the proposed relationships, i.e., abusive supervision leads to service sabotage through the mediating effect of revenge desire. The findings also conclude that PSR lessens the detrimental effects of abusive supervision on victims’ behavior with their customers. Finally, this research contributes to service sabotage literature by highlighting the possibility where abusive supervisors cause service sabotage behavior among victims. This study also shows the importance of PSR’s role in decreasing service sabotage behavior exhibited by victims of abusive supervisors in the service sector. (shrink)

本书选择了马、恩、列、毛及我国其他领导人的有关著作加以评述,力图概括指出马克思主义人权理论的基本内容和精髓。.

Digital technologies have changed nearly every aspect of our lives over the last two decades. As Warschauer, Zheng, and Park (2013, p. 825) put it, ‘there is little serious writing that is not done...