We define a notion of reducibility for subsets of a second countable T 0 topological space based on relatively continuous relations and admissible representations. This notion of reducibility induces a hierarchy that refines the Baire classes and the Hausdorff–Kuratowski classes of differences. It coincides with Wadge reducibility on zero dimensional spaces. However in virtually every second countable T 0 space, it yields a hierarchy on Borel sets, namely it is well founded and antichains are of length (...) at most 2. It thus differs from the Wadge reducibility in many important cases, for example on the real line $${\mathbb{R}}$$ or the Scott Domain $${\mathcal{P}\omega}$$. (shrink)

We prove that the Wadge order on the Borel subsets of the Scott domain is not a well-quasi-order, and that this feature even occurs among the sets of Borel rank at most 2. For this purpose, a specific class of countable 2-colored posets$\mathbb{P}_{emb} $equipped with the order induced by homomorphisms is embedded into the Wadge order on the$\Delta _2^0 $-degrees of the Scott domain. We then show that$\mathbb{P}_{emb} $admits both infinite strictly decreasing chains and infinite antichains with respect (...) to this notion of comparison, which therefore transfers to the Wadge order on the$\Delta _2^0 $-degrees of the Scott domain. (shrink)

We consider Borel sets of finite rank $A \subseteq\Lambda^\omega$ where cardinality of Λ is less than some uncountable regular cardinal K. We obtain a "normal form" of A, by finding a Borel set Ω, such that A and Ω continuously reduce to each other. In more technical terms: we define simple Borel operations which are homomorphic to ordinal sum, to multiplication by a countable ordinal, and to ordinal exponentiation of base K, under the map which sends every Borel set A (...) of finite rank to its Wadge degree. (shrink)

Let A and B be subsets of the space 2 N of sets of natural numbers. A is said to be Wadge reducible to B if there is a continuous map Φ from 2 N into 2 N such that A = Φ -1 (B); A is said to be monotone reducible to B if in addition the map Φ is monotone, that is, $a \subset b$ implies $\Phi (a) \subset \Phi(b)$ . The set A is said to be (...) monotone if a ∈ A and $a \subset b$ imply b ∈ A. For monotone sets, it is shown that, as for Wadge reducibility, sets low in the arithmetical hierarchy are nicely ordered. The ▵ 0 1 sets are all reducible to the (Σ 0 1 but not ▵ 0 1 ) sets, which are in turn all reducible to the strictly ▵ 0 2 sets, which are all in turn reducible to the strictly Σ 0 2 sets. In addition, the nontrivial Σ 0 n sets all have the same degree for n ≤ 2. For Wadge reducibility, these results extend throughout the Borel hierarchy. In contrast, we give two natural strictly Π 0 2 monotone sets which have different monotone degrees. We show that every Σ 0 2 monotone set is actually Σ 0 2 positive. We also consider reducibility for subsets of the space of compact subsets of 2 N . This leads to the result that the finitely iterated Cantor-Bendixson derivative D n is a Borel map of class exactly 2n, which answers a question of Kuratowski. (shrink)

If is a Polish metric space of dimension 0, then by Wadge’s lemma, no more than two Borel subsets of X are incomparable with respect to continuous reducibility. In contrast, our main result shows that for any metric space of positive dimension, there are uncountably many Borel subsets of that are pairwise incomparable with respect to continuous reducibility. In general, the reducibility that is given by the collection of continuous functions on a topological space \\) is (...) called the Wadge quasi-order for \\). As an application of the main result, we show that this quasi-order, restricted to the Borel subsets of a Polish space \\), is a well-quasiorder if and only if \\) has dimension 0. Moreover, we give further examples of applications of the construction of graph colorings that is used in the proofs. (shrink)

We show that if Ƒ is any "well-behaved" subset of the Borei functions and we assume the Axiom of Determinacy then the hierarchy of degrees on $P(^\omega \omega )$ induced by Ƒ turns out to look like the Wadge hierarchy (which is the special case where Ƒ is the set of continuous functions).

We present an infinite-game characterization of the well-founded semantics for function-free logic programs with negation. Our game is a simple generalization of the standard game for negation-less logic programs introduced by van Emden [M.H. van Emden, Quantitative deduction and its fixpoint theory, Journal of Logic Programming 3 37–53] in which two players, the Believer and the Doubter, compete by trying to prove a query. The standard game is equivalent to the minimum Herbrand model semantics of logic programming in the sense (...) that a query succeeds in the minimum model semantics iff the Believer has a winning strategy for the game which begins with the Doubter doubting this query. The game for programs with negation that we propose follows the same rules as the standard one, except that the players swap roles every time the play “passes through” negation. We start our investigation by establishing the determinacy of the new game by using some classical tools from the theory of infinite-games. Our determinacy result immediately provides a novel and purely game-theoretic characterization of the semantics of negation in logic programming. We proceed to establish the connections of the game semantics to the existing semantic approaches for logic programming with negation. For this purpose, we first define a refined version of the game that uses degrees of winning and losing for the two players. We then demonstrate that this refined game corresponds exactly to the infinite-valued minimum model semantics of negation [P. Rondogiannis,W.W. Wadge, Minimum model semantics for logic programs with negation-as-failure, ACM Transactions on Computational Logic 6 441–467]. This immediately implies that the unrefined game is equivalent to the well-founded semantics. (shrink)

In [9] we have considered a wide class of "well-behaved" reducibilities for sets of reals. In this paper we continue with the study of Borel reducibilities by proving a dichotomy theorem for the degree-structures induced by good Borel reducibilities. This extends and improves the results of [9] allowing to deal with a larger class of notions of reduction (including, among others, the Baire class ξ functions).

We present the design goals and metatheory of the Monadic Hybrid Calculus, a new formal system that has the same power as the Monadic Predicate Calculus. MHC allows quantification, including relative quantification, in a straightforward way without the use of bound variables, using a simple adaptation of modal logic notation. Thus “all Greeks are mortal” can be written as [G]M. MHC is also ‘hybrid’ in that it has individual constants, which allow us to formulate statements about particular individuals. Thus “Socrates (...) is Athenian and mortal” can be formalised as s.For our proof system, we use a simple adaptation of Beth-style tableaus. The availability of individual constants eliminates the need for labelled deduction.We discuss first the pragmatic and pedagogical advantages of MHC. Then we present the metatheory: formal syntax, semantics, proof rules, soundness, completeness and expressive equivalence with the Monadic Predicate Calculus. (shrink)

Attempts to extend the classical Hausdorff difference hierarchy to the case of partitions of a space to k > 2 subsets lead to non‐equivalent notions. In a hope to identify the “right” extension we consider the extensions appeared in the literature so far: the limit‐, level‐, Boolean and Wadge hierarchies of k ‐partitions. The advantages and disadvantages of the four hierarchies are discussed. The main technical contribution of this paper is a complete characterization of the Wadge degrees of (...) Δ02‐measurable k ‐partitions of the Baire space. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

We establish some results on the Borel and difference hierarchies in φ-spaces. Such spaces are the topological counterpart of the algebraic directed-complete partial orderings. E.g., we prove analogs of the Hausdorff Theorem relating the difference and Borel hierarchies and of the Lavrentyev Theorem on the non-collapse of the difference hierarchy. Some of our results generalize results of A. Tang for the space Pω. We also sketch some older applications of these hierarchies and present a new application to the question of (...) characterizing the ω-ary Boolean operations generating a given level of the Wadge hierarchy from the open sets. (shrink)

The Axiom of Projective Determinacy implies the existence of a universal $\utilde{\Pi}^{1}_{n}\setminus\utilde{\Delta}^{1}_{n}$ set for every $n \geq 1$. Assuming $\text{\upshape MA}(\aleph_{1})+\aleph_{1}=\aleph_{1}^{\mathbb{L}}$ there exists a universal $\utilde{\Pi}^{1}_{1}\setminus\utilde{\Delta}^{1}_{1}$ set. In ZFC there is a universal $\utilde{\Pi}^{0}_{\alpha}\setminus\utilde{\Delta}^{0}_{\alpha}$ set for every $\alpha$.

Matthias Schröder has asked the question whether there is a weakest discontinuous problem in the topological version of the Weihrauch lattice. Such a problem can be considered as the weakest unsolvable problem. We introduce the discontinuity problem, and we show that it is reducible exactly to the effectively discontinuous problems, defined in a suitable way. However, in which sense this answers Schröder’s question sensitively depends on the axiomatic framework that is chosen, and it is a positive answer if we work (...) in Zermelo–Fraenkel set theory with dependent choice and the axiom of determinacy $\mathsf {AD}$. On the other hand, using the full axiom of choice, one can construct problems which are discontinuous, but not effectively so. Hence, the exact situation at the bottom of the Weihrauch lattice sensitively depends on the axiomatic setting that we choose. We prove our result using a variant of Wadge games for mathematical problems. While the existence of a winning strategy for Player II characterizes continuity of the problem (as already shown by Nobrega and Pauly), the existence of a winning strategy for Player I characterizes effective discontinuity of the problem. By Weihrauch determinacy we understand the condition that every problem is either continuous or effectively discontinuous. This notion of determinacy is a fairly strong notion, as it is not only implied by the axiom of determinacy $\mathsf {AD}$, but it also implies Wadge determinacy. We close with a brief discussion of generalized notions of productivity. (shrink)

We study Polish spaces for which a set of possible distances $A \subseteq R^+$ is fixed in advance. We determine, depending on the properties of A, the complexity of the collection of all Polish metric spaces with distances in A, obtaining also example of sets in some Wadge classes where not many natural examples are known. Moreover we describe the properties that A must have in order that all Polish spaces with distances in that set belong to a given (...) class, such as zero-dimensional, locally compact, etc. These results lead us to give a fairly complete description of the complexity, with respect to Borel reducibility and again depending on the properties of A, of the relations of isometry and isometric embeddability between these Polish spaces. (shrink)

In this paper we study the logical strength of the determinacy of infinite binary games in terms of second order arithmetic. We define new determinacy schemata inspired by the Wadge classes of Polish spaces and show the following equivalences over the system RCA0*, which consists of the axioms of discrete ordered semi‐rings with exponentiation, Δ10 comprehension and Π00 induction, and which is known as a weaker system than the popularbase theory RCA0: 1. Bisep(Δ10, Σ10)‐Det* ↔ WKL0, 2. Bisep(Δ10, Σ20)‐Det* (...) ↔ ATR0 + Σ11 induction, 3. Bisep(Σ10, Σ20)‐Det* ↔ Sep(Σ10, Σ20)‐Det* ↔ Π11‐CA0, 4. Bisep(Δ20, Σ20)‐Det* ↔ Π11‐TR0, where Det* stands for the determinacy of infinite games in the Cantor space (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

We show that, assuming the Axiom of Determinacy, every non-selfdual Wadge class can be constructed by starting with those of level $\omega _1$ and iteratively applying the operations of expansion and separated differences. The proof is essentially due to Louveau, and it yields at the same time a new proof of a theorem of Van Wesep. The exposition is self-contained, except for facts from classical descriptive set theory.

We prove that the determinacy of all Lipschitz games, the determinacy of all Wadge games, and the semi-linear ordering principle for Lipschitz maps are all equivalent.

Suppose that any two Π12 sets are comparable in the sense of Wadge degrees. Then every real has a dagger. This argument proceeds by using the Dodd-Jensen core model theory to show that x ε ωω along with, say, “0† implies the existence of a Π12 norm of length u2. As a result of more recent work by John Steel, the same argument will extend to show that the Wadge comparability of all Π12 sets implies Π12 determinacy.

The Wadge hierarchy was originally defined and studied only in the Baire space. Here we extend the Wadge hierarchy of Borel sets to arbitrary topological spaces by providing a set-theoretic definition of all its levels. We show that our extension behaves well in second countable spaces and especially in quasi-Polish spaces. In particular, all levels are preserved by continuous open surjections between second countable spaces which implies e.g., several Hausdorff–Kuratowski -type theorems in quasi-Polish spaces. In fact, many results (...) hold not only for the Wadge hierarchy of sets but also for its extension to Borel functions from a space to a countable better quasiorder Q. (shrink)

We show that the semi-linear ordering principle for continuous functions implies the determinacy of all Wadge and Lipschitz games.

The wedge hierarchy was originally defined and studied only in the Baire space (and some other zero-dimensional spaces). Here we extend the Wadge hierarchy of Borel sets to arbitrary topological spaces by providing a set-theoretic definition of all its levels. We show that our extension behaves well in second countable spaces and especially in quasi-Polish spaces. In particular, all levels are preserved by continuous open surjections between second countable spaces which implies e.g. several Hausdorff-Kuratowski-type theorems in quasi-Polish spaces. In (...) fact, many results hold not only for the Wadge hierarchy of sets but also for its extension to Borel functions from a space to a countable better quasiorder Q. (shrink)

In January 2023, the Science and Security Board of the Bulletin of the Atomic Scientists moved the hands of the Doomsday Clock forward to 90 s before midnight.

The class Matr(C) of all matrices for a prepositional logic (, C) is investigated. The paper contains general results with no special reference to particular logics. The main theorem (Th. (5.1)) which gives the algebraic characterization of the class Matr(C) states the following. Assume C to be the consequence operation on a prepositional language induced by a class K of matrices. Let m be a regular cardinal not less than the cardinality of C. Then Matr (C) is the least class (...) of matrices containing K and closed under m-reduced products, submatrices, matrix homomorphisms, and matrix homomorphic counter-images. (shrink)

Arguments for the autonomy of psychology or other higher-level sciences have often taken the form of denying the possibility of reduction. The form of reduction most proponents and critics of the autonomy of psychology have in mind is theory reduction. Mechanistic explanations provide a different perspective. Mechanistic explanations are reductionist insofar as they appeal to lower-level entities—the component parts of a mechanism and their operations— to explain a phenomenon. However, unlike theory reductions, mechanistic explanations also recognize the fundamental role of (...) organization in enabling mechanisms to engage their environments as units (as well as the role of yet higher-level structures in constraining such engagement). Especially when organization is non-linear, it can enable mechanisms to generate phenomena that are quite surprising given the operations of the components taken in isolation. Such organization must be discovered—it cannot simply be derived from knowledge of lower-level parts and their operations. Moreover, the organized environments in which mechanisms operate must also be discovered. It is typically the higher-level disciplines that have the tools for discovering the organization within and between mechanisms. Although these inquiries are constrained by the knowledge of the parts and operations constituting the mechanism, they make their own autonomous contribution to understanding how a mechanism actually behaves. Thus, mechanistic explanations provide a strong sense of autonomy for higher levels of organization and the inquiries addressing them even while recognizing the distinctive contributions of reductionistic research investigating the operations of the lower level components. (shrink)

By analyzing how one obtains the Stone space of the reduced product of an indexed collection of Boolean algebras from the Stone spaces of those algebras, we derive a topological construction, the "reduced coproduct", which makes sense for indexed collections of arbitrary Tichonov spaces. When the filter in question is an ultrafilter, we show how the "ultracoproduct" can be obtained from the usual topological ultraproduct via a compactification process in the style of Wallman and Frink. We prove theorems dealing with (...) the topological structure of reduced coproducts (especially ultracoproducts) and show in addition how one may use this construction to gain information about the category of compact Hausdorff spaces. (shrink)

Background Retraction is a mechanism for alerting readers to unreliable material and other problems in the published scientific and scholarly record. Retracted publications generally remain visible and searchable, but the intention of retraction is to mark them as “removed” from the citable record of scholarship. However, in practice, some retracted articles continue to be treated by researchers and the public as valid content as they are often unaware of the retraction. Research over the past decade has identified a number of (...) factors contributing to the unintentional spread of retracted research. The goal of the Reducing the Inadvertent Spread of Retracted Science: Shaping a Research and Implementation Agenda (RISRS) project was to develop an actionable agenda for reducing the inadvertent spread of retracted science. This included identifying how retraction status could be more thoroughly disseminated, and determining what actions are feasible and relevant for particular stakeholders who play a role in the distribution of knowledge. -/- Methods These recommendations were developed as part of a year-long process that included a scoping review of empirical literature and successive rounds of stakeholder consultation, culminating in a three-part online workshop that brought together a diverse body of 65 stakeholders in October–November 2020 to engage in collaborative problem solving and dialogue. Stakeholders held roles such as publishers, editors, researchers, librarians, standards developers, funding program officers, and technologists and worked for institutions such as universities, governmental agencies, funding organizations, publishing houses, libraries, standards organizations, and technology providers. Workshop discussions were seeded by materials derived from stakeholder interviews (N = 47) and short original discussion pieces contributed by stakeholders. The online workshop resulted in a set of recommendations to address the complexities of retracted research throughout the scholarly communications ecosystem. -/- Results The RISRS recommendations are: (1) Develop a systematic cross-industry approach to ensure the public availability of consistent, standardized, interoperable, and timely information about retractions; (2) Recommend a taxonomy of retraction categories/classifications and corresponding retraction metadata that can be adopted by all stakeholders; (3) Develop best practices for coordinating the retraction process to enable timely, fair, unbiased outcomes; and (4) Educate stakeholders about pre- and post-publication stewardship, including retraction and correction of the scholarly record. -/- Conclusions Our stakeholder engagement study led to 4 recommendations to address inadvertent citation of retracted research, and formation of a working group to develop the Communication of Retractions, Removals, and Expressions of Concern (CORREC) Recommended Practice. Further work will be needed to determine how well retractions are currently documented, how retraction of code and datasets impacts related publications, and to identify if retraction metadata (fails to) propagate. Outcomes of all this work should lead to ensuring retracted papers are never cited without awareness of the retraction, and that, in public fora outside of science, retracted papers are not treated as valid scientific outputs. (shrink)

We study the behavior of the game operator $$ on Wadge classes of Borel sets. In particular we prove that the classical Moschovakis results still hold in this setting. We also characterize Wadge classes ${\bf{\Gamma }}$ for which the class has the substitution property. An effective variation of these results shows that for all $1 \le \eta < \omega _1^{{\rm{CK}}}$ and $2 \le \xi < \omega _1^{{\rm{CK}}}$, is a Spector class while is not.

Is it possible to give an explicit definition of belief in terms of subjective probability, such that believed propositions are guaranteed to have a sufficiently high probability, and yet it is neither the case that belief is stripped of any of its usual logical properties, nor is it the case that believed propositions are bound to have probability 1? We prove the answer is ‘yes’, and that given some plausible logical postulates on belief that involve a contextual “cautiousness” threshold, there (...) is but one way of determining the extension of the concept of belief that does the job. The qualitative concept of belief is not to be eliminated from scientific or philosophical discourse, rather, by reducing qualitative belief to assignments of resiliently high degrees of belief and a “cautiousness” threshold, qualitative and quantitative belief turn out to be governed by one unified theory that offers the prospects of a huge range of applications. Within that theory, logic and probability theory are not opposed to each other but go hand in hand. (shrink)

Social decision-making involving risks ideally results in obligations to avoid expected harms or keep them within acceptable limits. Ambitious goals aimed at avoiding or greatly reducing risks might not be feasible, forcing the acceptance of higher degrees of risk (i.e. unrealistic levels of risk reduction are revised to comport with beliefs regarding abilities). In this paper, the philosophical princi- ple ‘ought implies can’ is applied to the management of complex risks, exempli- fied by the risks associated with climate change. In (...) its common interpretation, the principle states that we cannot expect an agent to perform something that lies beyond his or her abilities. However, it is here argued that this principle requires setting thresholds for legitimate claims of inabilities that justify the waiving of normative demands. This paper discuss three claims: (1) that caution is required before revising a risk-reducing goal that is perhaps exceedingly ambitious; (2) that claims on abilities are not only descriptive, but also value-laden; and (3) that the function of a goal has to be clarified before risk-reducing goals are revised. Risk-reducing goals that initially seem unrealistic arguably serve performance- enhancing purposes in risk management. Neglecting such goals could lead to choosing less desirable, but certainly feasible, risk-reducing goals. (shrink)

The most commonly heard proposals for reducing possible worlds to language succumb to a simple cardinality argument: it can be shown that there are more possible worlds than there are linguistic entities provided by the proposal. In this paper, I show how the standard proposals can be generalized in a natural way so as to make better use of the resources available to them, and thereby circumvent the cardinality argument. Once it is seen just what the limitations are on these (...) more general proposals, it can be clearly seen where the real difficulty lies with any attempt to reduce possible worlds to language. Roughly, the difficulty is this: no actual language could have the descriptive resources needed to represent all the ways things might have been. I conclude by arguing that this same difficulty spells doom for any nominalist or conceptualist proposal for reducing possible worlds. (shrink)

Nathan Salmon, in his paper Trans-World Identification and Stipulation (1996) purports to give a proof for the claim that facts concerning trans-world identity cannot be conceptually reduced to general facts. He calls this claim ‘Extreme Haecceitism.’ I argue that his proof is fallacious. However, I also contend that the analysis and ultimate rejection of his proof clarifies the fundamental issues that are at stake in the debate between the reductionist and haecceitist solutions to the problem of trans-world identity. These issues (...) hinge on the ability of modal logic and possible worlds semantics to draw a hard and fast distinction between the logic and the metaphysics of modal logic. I shall claim that the considerations in this paper call into question the viability of such a distinction. (shrink)

We introduce the computable FS-jump, an analog of the classical Friedman–Stanley jump in the context of equivalence relations on the natural numbers. We prove that the computable FS-jump is proper with respect to computable reducibility. We then study the effect of the computable FS-jump on computably enumerable equivalence relations (ceers).

There are few more unsettling philosophical questions than this: What happens in attempts to reduce some properties to some other more fundamental properties?

Dominic Lopes proposes that seeing-in admits of kinds. He thus suggests five ways of seeing-in that he feels do justice to the variety of pictorial representations. More recently Dan Cavedon-Taylor has argued that the space of seeing-in marked out by Lopes is incomplete, and thus proposes a sixth kind of seeing-in that fits neatly into the taxonomy. I argue that the phenomenon of seeing-in does not divide in as many ways as Lopes and Cavedon-Taylor propose. I show that the purported (...) cases of pseudo-design seeing do not demonstrate that actual design properties are not experienced and as such these cases can be captured by the other ‘ways of seeing-in’ that Lopes identifies. I also argue against the claim that actualism is a distinct kind of seeing-in. Thus the space of seeing-in ought to be significantly reduced. (shrink)

The universality of critical phenomena is best explained by appeal to the Renormalisation Group (RG). Batterman and Morrison, among others, have claimed that this explanation is irreducible. I argue that the RG account is reducible, but that the higher-level explanation ought not to be eliminated. I demonstrate that the key assumption on which the explanation relies – the scale invariance of critical systems – can be explained in lower-level terms; however, we should not replace the RG explanation with a bottom-up (...) account, rather we should acknowledge that the explanation appeals to dependencies which may be traced down to lower levels. (shrink)

This text is the result of academic research aimed at achieve the goal of finding viable ways to reduce social inequalities in the Brazilian context through the education. Our main focus was the pursuit of reducing violence through education and the ways in which education can promote development and security human in general. In order to achieve this goal with clarity and consistency, I address theoretical and practical issues. The part theory clarifies the essential concepts and establishes the background for (...) the rest of the work. The practical part is a application of these concepts in the Brazilian educational scenario / Este texto é o resultado de uma pesquisa acadêmica que visa atingir o objetivo de encontrar formas viáveis para reduzir as desigualdades sociais no contexto brasileiro por meio da educação. Nosso foco principal foi a busca da redução da violência por intermédio da educação e as maneiras pelas quais a educação pode promover o desenvolvimento e a segurança humana no geral. Para alcançar essa meta com clareza e consistência, abordo questões de cunho teórico e prático. A parte teórica esclarece os conceitos essenciais e estabelece o pano de fundo para o restante do trabalho. A parte prática é uma aplicação desses conceitos no cenário educacional brasileiro. (shrink)

Mindfulness—the awareness of the present moment and experiences in daily life—contributes to genuine intrinsic and social-oriented values and curbs materialistic and hedonistic values. In the context of materialism, money is power. Avaricious individuals take risks and are likely to engage in dishonesty. Very little research has investigated the effects of mindfulness in reducing the avaricious monetary attitudes and enhancing ethical consumer beliefs. In this study, we theorize that mindfulness improves consumer ethics directly and indirectly by lowering avaricious monetary attitudes. To (...) test our theory, we collected data from 523 individuals with the Mindfulness-Based Stress Reduction training and 307 individuals without MBSR. The results of our whole sample support our theory. Three multiple-group confirmatory factor analyses reveal intriguing discoveries. First, with MBSR training, mindfulness excites consumer ethical beliefs directly and indirectly. Without training, trait mindfulness fails to reduce monetary attitudes—mindfulness training matters. Second, the power of MBSR training holds for participants completing the training within 1 year, but wears off after 1 year—the duration after training matters. Finally, after 1 year, the training retains its strength for those who practice mindfulness, but weakens its power for those who do not—practice matters. We shed light on mindfulness, monetary wisdom, and consumer ethics, in particular, and business ethics, in general. (shrink)

There are many social psychological theories regarding the nature of prejudice, but only one major theory of prejudice reduction: under the right circumstances, prejudice between groups will be reduced with increased contact. On the one hand, the contact hypothesis has a range of empirical support and has been a major force in social change. On the other hand, there are practical and ethical obstacles to any large-scale controlled test of the hypothesis in which relevant variables can be manipulated. Here we (...) construct a spatialized model that tests the core hypothesis in a large array of game-theoretic agents. Robust results offer a new kind of support for the contact hypothesis: results in simulation do accord with a hypothesis of reduced prejudice with increased contact. The spatialized game-theoretic model also suggests a deeper explanation for at least some of the social psychological phenomena at issue. (shrink)

Believing in free will may arise from a biological need for control. People induced to disbelieve in free will show impulsive and antisocial tendencies, suggesting a reduction of the willingness to exert self-control. We investigated whether undermining free will affects two aspects of self-control: intentional inhibition and perceived self-control. We exposed participants either to anti-free will or to neutral messages. The two groups then performed a task that required self-control to inhibit a prepotent response. No-free will participants showed less intentional (...) inhibitions than controls, suggesting a reduction of self-control. We assessed perceived self-control by asking participants whether the response resulted from a deliberate intention or from an impulsive reaction. Perceived self-control was lower in the no-free will group than in control group. Our findings show that undermining free will can degrade self-control and provide insights into how disbelieving in free will leads to antisocial tendencies. (shrink)

This article discusses the ethics of knowledge production from a cultural point of view, in contrast with the more usual emphasis on the ethical issues facing individuals involved in KP. Here, the emphasis is on the cultural environment within which individuals, groups and institutions perform KP. A principal purpose is to suggest ways in which reliable scientific knowledge could be produced more efficiently. The distinction between ethical hazard and ethical behaviour is noted. Ethical hazards cannot be eliminated but they can (...) be reduced if the cultural ambience is suitable. The main suggestions for reducing ethical hazards in KP relate to the review process. It is argued that some defects of the current, largely anonymous, review process could be ameliorated by a process of comprehensive, open and ongoing review. This includes partial professionalisation of the work of reviewing. Review at several stages is a vital part of the long filtering that incorporates some claims into the canon of reliable knowledge. The review process would be an acknowledged and explicit part of KP—a respected, public and rewarded activity. COOR would be expensive but cost-effective. The costs should be built explicitly into research culture. Finally, the considerations about a more ‘KP friendly’ culture lead to advocacy of a ‘long-term, short-term’ synthesis; that is, of the synthesis of long-term vision, such as a more cooperative and less competitive culture, with incremental changes which may be implemented in the short term. (shrink)

A key idea in both Frege's development of arithmetic in theGrundlagen[7] and Zermelo's 1904 proof [10] of the well-ordering theorem is that of a “type reducing” correspondence between second-level and first-level entities. In Frege's construction, the correspondence obtains betweenconceptandnumber, in Zermelo's (through the axiom of choice), betweensetandmember. In this paper, a formulation is given and a detailed investigation undertaken of a system ℱ of many-sorted first-order logic (first outlined in the Appendix to [6]) in which this notion of type reducing (...) correspondence is accorded a central role and which enables Frege's and Zermelo's constructions to be presented in such a way as to reveal their essential similarity. By adapting Bourbaki's version of Zermelo's proof of the well-ordering theorem, we show that, within ℱ, any correspondencecbetween second-level entities (here calledconcepts) and first-level ones (here calledobjects) induces a well-ordering relationW(c) in a canonical manner. We shall see that, whencis the “Fregean” correspondence between concepts and cardinal numbers,W(c) is (the well-ordering of) the ordinalω+ 1, and whencis a “Zermelian” choice function on concepts,W(c) is a well-ordering of the universal concept embracing all objects.In ℱ an important role is played by the notion ofextensionof a concept. To each conceptXwe assume there is assigned an objecte(X) in such a way that, for any conceptsX, Ysatisfying a certain predicateE, we havee(X) =e(Y) iff the same objects fall underXandY. (shrink)

The idea that causation can be reduced to transmission of an amount of some conserved quantity between events is spelled out and defended against important objections. Transmission is understood as a symmetrical relation of copresence in two distinct events. The actual asymmetry of causality has its origin in the asymmetrical character of certain irreversible physical processes and then spreads through the causal net. This conception is compatible with the possibility of backwards causation and with a causal theory of time. Genidentity, (...) the persistence of concrete objects, can be given an explanation in causal terms. The transmission theory is shown to escape difficulties faced by two important alternative theories of causation: Salmon's (1984) Mark Transmission Theory and Dowe's (1992a) Conserved Quantities Theory. (shrink)