Third language learners have great potential in developing creativity; however, the factors affecting L3 learners’ creativity have received little attention. This study investigated the relationships between proactive personality, three different thinking patterns, and creativity among L3 learners. The participants were 220 Chinese students who attended an obligatory L3 course in college. The results showed that proactive personality, growth mindset, golden mean thinking, and creativity had significant intercorrelations. Moreover, the role of growth mindset and golden mean thinking as mediators of the (...) proactive personality and creativity relation was supported, and the mediating effect of growth mindset was larger than that of golden mean thinking. However, the fixed mindset did not show a significant indirect effect on the path from proactive personality to creativity. This is the first research to treat growth mindset, fixed mindset, and golden mean thinking as mediating variables on the path from proactive personality to creativity, particularly demonstrating that golden mean thinking, which is specific to Asian students and located midway between a growth mindset and a fixed mindset, can cultivate creativity. Some suggestions for fostering creativity in L3 students were also included in this study. (shrink)

Recent years witnessed a growing interest in non-standard epistemic logics of knowing whether, knowing how, knowing what, knowing why and so on. The new epistemic modalities introduced in those logics all share, in their semantics, the general schema of ∃x◻φ, e.g., knowing how to achieve φ roughly means that there exists a way such that you know that it is a way to ensure that φ. Moreover, the resulting logics are decidable. Inspired by those particular logics, in this work, we (...) propose a very general and powerful framework based on quantifier-free predicate language extended by a new modality, which packs exactly ∃x◻ together. We show that the resulting language, though much more expressive, shares many good properties of the basic propositional modal logic over arbitrary models, such as finite-tree-model property and van Benthem-like characterization w.r.t.\ first-order modal logic. We axiomatize the logic over S5 frames with intuitive axioms to capture the interaction between the new modality and know-that operator in an epistemic setting. (shrink)

This article explores micro- and macro-level variables that influence the incidence of bribery payouts by firms. A rich data set with information from 55 countries was utilized to achieve this objective. Results of logit regression models indicate that there are a number of micro- and macro-level factors that significantly affect the incidence of bribery payouts. This suggests that it is not only the characteristics of a firm but also the environment of doing business that affect the firm's bribery decision. The (...) results of this study provides information that may help firms develop strategies to reduce corruption in their respective industries and thereby improve their image of corporate social responsibility. The analysis also points to possible policy directions that governments could undertake in order to reduce the incidence of bribery in their country. (shrink)

In the literature, different axiomatizations of Public Announcement Logic (PAL) have been proposed. Most of these axiomatizations share a “core set” of the so-called “reduction axioms”. In this paper, by designing non-standard Kripke semantics for the language of PAL, we show that the proof system based on this core set of axioms does not completely axiomatize PAL without additional axioms and rules. In fact, many of the intuitive axioms and rules we took for granted could not be derived from the (...) core set. Moreover, we also propose and advocate an alternative yet meaningful axiomatization of PAL without the reduction axioms. The completeness is proved directly by a detour method using the canonical model where announcements are treated as merely labels for modalities as in normal modal logics. This new axiomatization and its completeness proof may sharpen our understanding of PAL and can be adapted to other dynamic epistemic logics. (shrink)

When we say “I know why he was late”, we know not only the fact that he was late, but also an explanation of this fact. We propose a logical framework of “knowing why” inspired by the existing formal studies on why-questions, scientific explanation, and justification logic. We introduce the Kyi\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal {K}}{}\textit{y}}_i$$\end{document} operator into the language of epistemic logic to express “agent i knows why φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} (...) \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varphi $$\end{document}” and propose a Kripke-style semantics of such expressions in terms of knowing an explanation of φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varphi $$\end{document}. We obtain two sound and complete axiomatizations w.r.t. two different model classes depending on different assumptions about introspection. Finally we connect our logic with justification logic technically by providing an alternative semantics and an in-depth comparison on various design choices. (shrink)

Electroencephalogram has been widely utilized in emotion recognition. Psychologists have found that emotions can be divided into conscious emotion and unconscious emotion. In this article, we explore to classify subliminal emotions with EEG signals elicited by subliminal face stimulation, that is to select appropriate features to classify subliminal emotions. First, multi-scale sample entropy, wavelet packet energy, and wavelet packet entropy of EEG signals are extracted. Then, these features are fed into the decision tree and improved random forest, respectively. The classification (...) accuracy with Ei and WpEn is higher than MSpEn, which shows that Ei and WpEn can be used as effective features to classify subliminal emotions. We compared the classification results of different features combined with the decision tree algorithm and the improved random forest algorithm. The experimental results indicate that the improved random forest algorithm attains the best classification accuracy for subliminal emotions. Finally, subliminal emotions and physiological proof of subliminal affective priming effect are discussed. (shrink)

Epistemic logic has become a major field of philosophical logic ever since the groundbreaking work by Hintikka [58]. Despite its various successful applications in theoretical computer science, AI, and game theory, the technical development of the field has been mainly focusing on the propositional part, i.e., the propositional modal logics of “knowing that”. However, knowledge is expressed in everyday life by using various other locutions such as “knowing whether”, “knowing what”, “knowing how” and so on (knowing-wh hereafter). Such knowledge expressions (...) are better captured in quantified epistemic logic, as was already discussed by Hintikka [58] and his sequel works at length. This paper aims to draw the attention back again to such a fascinating but largely neglected topic. We first survey what Hintikka and others did in the literature of quantified epistemic logic, and then advocate a new quantifier-free approach to study the epistemic logics of knowing-wh, which we believe can balance expressivity and complexity, and capture the essential reasoning patterns about knowing-wh. We survey our recent line of work on the epistemic logics of ‘knowing whether”, “knowing what” and “knowing how” to demonstrate the use of this new approach. (shrink)

In this paper, we propose a decidable single-agent modal logic for reasoning about goal-directed “knowing how”, based on ideas from linguistics, philosophy, modal logic, and automated planning in AI. We first define a modal language to express “I know how to guarantee \ given \” with a semantics based not on standard epistemic models but on labeled transition systems that represent the agent’s knowledge of his own abilities. The semantics is inspired by conformant planning in AI. A sound and complete (...) proof system is given to capture valid reasoning patterns, which highlights the compositional nature of “knowing how”. The logical language is further extended to handle knowing how to achieve a goal while maintaining other conditions. (shrink)

This article explores micro- and macro-level variables that influence the incidence of bribery payouts by firms. A rich data set with information from 55 countries was utilized to achieve this objective. Results of logit regression models indicate that there are a number of micro- and macro-level factors that significantly affect the incidence of bribery payouts. This suggests that it is not only the characteristics of a firm but also the environment of doing business that affect the firm's bribery decision. The (...) results of this study provides information that may help firms develop strategies to reduce corruption in their respective industries and thereby improve their image of corporate social responsibility. The analysis also points to possible policy directions that governments could undertake in order to reduce the incidence of bribery in their country. (shrink)

A proposition is noncontingent, if it is necessarily true or it is necessarily false. In an epistemic context, ‘a proposition is noncontingent’ means that you know whether the proposition is true. In this paper, we study contingency logic with the noncontingency operator? but without the necessity operator 2. This logic is not a normal modal logic, because?→ is not valid. Contingency logic cannot define many usual frame properties, and its expressive power is weaker than that of basic modal logic over (...) classes of models without reflexivity. These features make axiomatizing contingency logics nontrivial, especially for the axiomatization over symmetric frames. In this paper, we axiomatize contingency logics over various frame classes using a novel method other than the methods provided in the literature, based on the ‘almost-definability’ schema AD proposed in our previous work. We also present extensions of contingency logic with dynamic operators. Finally, we compare our work to the related work in the fields of contingency logic and ignorance logic, where the two research communities have similar results but are apparently unaware of each other’s work. One goal of our paper is to bridge this gap. (shrink)

In this article, we present an attempt to reconcile intellectualism and the anti-intellectualist ability account of knowledge-how by reducing “S knows how to F” to, roughly speaking, “S knows that she has the ability to F demonstrated by a concrete way w.” More precisely, “S has a certain ability” is further formalized as the proposition that S can guarantee a certain goal by a concrete way w of some method under some precondition. Having the knowledge of our own ability, we (...) can plan our future actions accordingly, which would not be possible by merely having the ability without knowing it, and this pinpoints the crucial difference between knowledge-how and ability. Our semi-formal account avoids most of the objections to both intellectualism and the anti-intellectualist ability account, and provides a multistage learning process of knowledge-how, which reveals various subtleties. (shrink)

In this paper1, we develop an epistemic logic to specify and reason about the information flow on the underlying communication channels. By combining ideas from Dynamic Epistemic Logic (DEL) and Interpreted Systems (IS), our semantics offers a natural and neat way of modelling multi-agent communication scenarios with different assumptions about the observational power of agents. We relate our logic to the standard DEL and IS..

Epistemic protocols are communication protocols aiming at transfer of knowledge in a controlled way. Typically, the preconditions or goals for protocol actions depend on the knowledge of agents, often in nested form. Informal epistemic protocol descriptions for muddy children, coordinated attack, dining cryptographers, Russian cards, secret key exchange are well known. The contribution of this paper is a formal study of a natural requirement on epistemic protocols, that the contents of the protocol can be assumed to be common knowledge. By (...) formalizing this requirement we can prove that there can be no unbiased deterministic protocol for the Russian cards problem. For purposes of our formal analysis we introduce an epistemic protocol language, and we show that its model checking problem is decidable. (shrink)

Security properties naturally combine temporal aspects of protocols with aspects of knowledge of the agents. Since BAN-logic, there have been several initiatives and attempts to incorpórate epistemics into the analysis of security protocols. In this paper, we give an overview of work in the field and present it in a unified perspective, with comparisons on technical subtleties that have been employed in different approaches. Also, we study to which degree the use of epistemics is essential for the analysis of security (...) protocols. We look for formal conditions under which knowledge modalities can bring extra expressive power to pure temporal languages. On the other hand, we discuss the cost of the epistemic operators in terms of model checking complexity. (shrink)

The social, ethical and legal implications of discoveries in the neurosciences.

Typically, fair machine learning research focuses on a single decision maker and assumes that the underlying population is stationary. However, many of the critical domains motivating this work are characterized by competitive marketplaces with many decision makers. Realistically, we might expect only a subset of them to adopt any non-compulsory fairness-conscious policy, a situation that political philosophers call partial compliance. This possibility raises important questions: how does partial compliance and the consequent strategic behavior of decision subjects affect the allocation outcomes? (...) If k% of employers were to voluntarily adopt a fairness-promoting intervention, should we expect k% progress (in aggregate) towards the benefits of universal adoption, or will the dynamics of partial compliance wash out the hoped-for benefits? How might adopting a global (versus local) perspective impact the conclusions of an auditor? In this paper, we propose a simple model of an employment market, leveraging simulation as a tool to explore the impact of both interaction effects and incentive effects on outcomes and auditing metrics. Our key findings are that at equilibrium: (1) partial compliance by k% of employers can result in far less than proportional (k%) progress towards the full compliance outcomes; (2) the gap is more severe when fair employers match global (vs local) statistics; (3) choices of local vs global statistics can paint dramatically different pictures of the performance vis-a-vis fairness desiderata of compliant versus non-compliant employers; (4) partial compliance based on local parity measures can induce extreme segregation. Finally, we discuss implications for auditors and insights concerning the design of regulatory frameworks. (shrink)

本书介绍了管理伦理思想的产生、西方管理伦理研究的进展、我国管理伦理研究的现状、管理伦理研究的主题等内容。.

What role does our knowledge about the ideal society play in guiding policymaking in the real world? One intuitive answer is to approximate. Namely, we have a duty to approximate the ideal within the relevant constraints of feasibility. However, political philosophers seem to have what might be called ‘approximatophobia'. Many philosophers, including idealists such as David Estlund, warn against approximation. Their criticism is chiefly motivated by ‘the problem of second best’, which points out that your second-best option may not be (...) closest to your best option. This paper aims to dispel ‘approximatophobia'. The difficulty posed by the problem of second best is often overstated. More positively, I present a novel defence of approximation, arguing that approximation of an ideal can be a reasonably reliable default strategy of action guidance in the real world. Difficulties that may afflict the project of approximation can be mitigated by sophistication of the project of approximation. After showing that critics of approximation overstep their mark in issuing the strong or moderate warning against approximation, I propose an account of sophisticated approximation. It seeks a series of reforms that make existing social institutions closer to the ideal based on careful selection of frame of analysis. Three virtuous correlations are identified as indicators for successful project of approximation, linking descriptive similarity to desirability, feasibility and knowledge of the ideal. I also explain a two-staged strategy of sophisticating the way you approximate the ideal, with an expected positive feedback effect. (shrink)

This paper shows how propositional dynamic logic can be interpreted as a logic for multi-agent belief revision. For that we revise and extend the logic of communication and change of [9]. Like LCC, our logic uses PDL as a base epistemic language. Unlike LCC, we start out from agent plausibilities, add their converses, and build knowledge and belief operators from these with the PDL constructs. We extend the update mechanism of LCC to an update mechanism that handles belief change as (...) relation substitution, and we show that the update part of this logic is more expressive than either that of LCC or that of doxastic/epistemic PDL with a belief change modality. It is shown that the properties of knowledge and belief are preserved under any update, and that the logic is complete. © 2008 Springer-Verlag Berlin Heidelberg. (shrink)

Kant’s published arguments for the non-spatiotemporality of things in themselves have not been well received. I argue that Kant has available to himself an argument for the non-spatiotemporality of things in themselves that is premised upon a disparity between the compositional structure of the intelligible world and the structure of space and time. I argue that Kant was unwaveringly committed to the premises of this argument throughout his career and that he was aware of their idealistic implications. I also argue (...) that this argument is consistent with Kant’s restrictive mature epistemology. If my argument is successful, then even if Kant’s published arguments for transcendental idealism fail, we need not regard his ambitious metaphysical project as a failure. (shrink)

Kant rejects the ontological argument on the grounds that the ontological argument inescapably must assume that existence is a “determination” or “real predicate,” which it is not. Most understand Kant’s argument for this claim to be premised upon his distinctive proto-Fregean theory of existence. But this leaves Kant dialectically vulnerable: the defender of the ontological argument can easily reject this as question-begging. I show that Kant relies upon two distinct arguments, both of which contend that the claim that existence is (...) a determination is inconsistent with bedrock ontological set pieces assumed by rationalist defenders of the ontological argument. (shrink)

In this paper, we first propose a simple formal language to specify types of agents in terms of necessary conditions for their announcements. Based on this language, types of agents are treated as ‘first-class citizens’ and studied extensively in various dynamic epistemic frameworks which are suitable for reasoning about knowledge and agent types via announcements and questions. To demonstrate our approach, we discuss various versions of Smullyan’s Knights and Knaves puzzles, including the Hardest Logic Puzzle Ever (HLPE) proposed by Boolos (...) (in Harv Rev Philos 6:62–65, 1996). In particular, we formalize HLPE and verify a classic solution to it. Moreover, we propose a spectrum of new puzzles based on HLPE by considering subjective (knowledge-based) agent types and relaxing the implicit epistemic assumptions in the original puzzle. The new puzzles are harder than the previously proposed ones in the literature, in the sense that they require deeper epistemic reasoning. Surprisingly, we also show that a version of HLPE in which the agents do not know the others’ types does not have a solution at all. Our formalism paves the way for studying these new puzzles using automatic model checking techniques. (shrink)

• We study a new composition operation on (epistemic) multiagent models and update actions that takes vocabulary extensions into account.

(2001). Preconception Sex Selection: The Perspective of a Person of the Undesired Gender. The American Journal of Bioethics: Vol. 1, No. 1, pp. 37-38.

The Iowa Gambling Task (IGT) and the Soochow Gambling Task (SGT) are two experience-based risky decision-making tasks for examining decision-making deficits in clinical populations. Several cognitive models, including the expectancy-valence learning model (EVL) and the prospect valence learning model (PVL), have been developed to disentangle the motivational, cognitive, and response processes underlying the explicit choices in these tasks. The purpose of the current study was to develop an improved model that can fit empirical data better than the EVL and PVL (...) models and, in addition, produce more consistent parameter estimates across the IGT and SGT. Twenty-six opiate users (mean age 34.23; SD 8.79) and 27 control participants (mean age 35; SD 10.44) completed both tasks. Eighteen cognitive models varying in evaluation, updating, and choice rules were fit to individual data and their performances were compared to that of a statistical baseline model to find a best fitting model. The results showed that the model combining the prospect utility function treating gains and losses separately, the decay-reinforcement updating rule, and the trial-independent choice rule performed the best in both tasks. Furthermore, the winning model produced more consistent individual parameter estimates across the two tasks than any of the other models. (shrink)

Abstract:The haptic sense is an essential component of aesthetic evaluation that is often overlooked in today’s mobile internet age. Unlike hearing and vision, the sense of touch is less widely transmitted. Unfortunately, most aesthetic theories and explanations have focused solely on the visual and auditory senses, with minimal attention given to tactile evaluation. To address this gap in knowledge, we have collected studies on tactile aesthetics within the framework of experimental aesthetics from 2000 to 2022. After statistical generalization, our findings (...) suggest the following: The criteria for evaluating tactile aesthetics were mostly dichotomous, that is, positive (like/appreciation/pleasure) and negative (dislike/disgust/unpleasant). Tactile aesthetics predominantly involved the toucher dimension (synesthesia/need for touch/touch pattern) and the touch sample dimension (shape/type/texture), with the commonly overlooked factors of “need for touch” and “touch pattern.” Some studies did not restrict the shape and material of the touch samples. Based on our findings, we have systematically summarized and concluded what tactile factors influence aesthetic evaluation and have analyzed future research trends. (shrink)

Transnational articulation programmes are one way China is attempting to advance its higher education system. We report a study of twelve Chinese students’ experiences in two China-Australia 2...

Recently, decomposition-based multiobjective evolutionary algorithms have good performances in the field of multiobjective optimization problems and have been paid attention by many scholars. Generally, a MOP is decomposed into a number of subproblems through a set of weight vectors with good uniformly and aggregate functions. The main role of weight vectors is to ensure the diversity and convergence of obtained solutions. However, these algorithms with uniformity of weight vectors cannot obtain a set of solutions with good diversity on some MOPs (...) with complex Pareto optimal fronts. To deal with this problem, an improved decomposition-based multiobjective evolutionary algorithm with adaptive weight adjustment is proposed. Firstly, a new method based on uniform design and crowding distance is used to generate a set of weight vectors with good uniformly. Secondly, according to the distances of obtained nondominated solutions, an adaptive weight vector adjustment strategy is proposed to redistribute the weight vectors of subobjective spaces. Thirdly, a selection strategy is used to help each subobjective space to obtain a nondominated solution. Comparing with six efficient state-of-the-art algorithms, for example, NSGAII, MOEA/D, MOEA/D-AWA, EMOSA, RVEA, and KnEA on some benchmark functions, the proposed algorithm is able to find a set of solutions with better diversity and convergence. (shrink)

Weakly Aggregative Modal Logic (WAML) is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. WAML has some interesting applications on epistemic logic and logic of games, so we study some basic model theoretical aspects of WAML in this paper. Specifically, we give a van Benthem-Rosen characterization theorem of WAML based on an intuitive notion of bisimulation and show that each basic WAML system Kn lacks Craig Interpolation.