Cholak, Groszek and Slaman proved in J Symb Log 66:881–901, 2001 that there is a nonzero computably enumerable (c.e.) degree cupping every low c.e. degree to a low c.e. degree. In the same paper, they pointed out that every nonzero c.e. degree can cup a low2 c.e. degree to a nonlow2 degree. In Jockusch et al. (Trans Am Math Soc 356:2557–2568, 2004) improved the latter result by showing that every nonzero c.e. degree c (...) is cuppable to a high c.e. degree by a low2 c.e. degree b. It is natural to ask in which subclass of low2 c.e. degrees can b in Jockusch et al. (Trans Am Math Soc 356:2557–2568, 2004) be located. Wu proved in Math Log Quart 50:189–201, 2004 that b can be cappable. We prove in this paper that b in Jockusch, Li and Yang’s result can be noncuppable, improving both Jockusch, Li and Yang, and Wu’s results. (shrink)

In this paper we show that there is a pair of superhigh r.e. degree that forms a minimal pair. An analysis of the proof shows that a critical ingredient is the growth rates of certain order functions. This leads us to investigate certain high r.e. degrees, which resemble ∅′ very closely in terms of ∅′-jump traceability. In particular, we will construct an ultrahigh degree which is cappable.

We show that van Lambalgen's Theorem fails with respect to recursive randomness and Schnorr randomness for some real in every high degree and provide a full characterization of the Turing degrees for which van Lambalgen's Theorem can fail with respect to Kurtz randomness. However, we also show that there is a recursively random real that is not Martin-Löf random for which van Lambalgen's Theorem holds with respect to recursive randomness.

One of the most efficient nondestructive methods for pipeline in-line inspection is magnetic flux leakage inspection. Estimating the size of the defect from MFL signal is one of the key problems of MFL inspection. As the inspection signal is usually contaminated by noise, sizing the defect is an ill-posed inverse problem, especially when sizing the depth as a complex shape. An actor-critic structure-based algorithm is proposed in this paper for sizing complex depth profiles. By learning with more information from the (...) depth profile without knowing the corresponding MFL signal, the algorithm proposed saves computational costs and is robust. A pinning strategy is embedded in the reconstruction process, which highly reduces the dimension of action space. The pinning actor-critic structure helps to make the reward for critic network more efficient when reconstructing the depth profiles with high degrees of freedom. A nonlinear FEM model is used to test the effectiveness of algorithm proposed under 20 dB noise. The results show that the algorithm reconstructs the depth profile of defects with good accuracy and is robust against noise. (shrink)

We construct a ${\Sigma^0_2}$ e-degree which is both high and noncuppable. Thus demonstrating the existence of a high e-degree whose predecessors are all properly ${\Sigma^0_2}$.

We construct a high c.e. degree which is not the join of two minimal degrees and so refute Posner's conjecture that every high c.e. degree is the join of two minimal degrees. Additionally, the proof shows that there is a high c.e. degree a such that for any splitting of a into degrees b and c one of these degrees bounds a 1-generic degree.

An r.e. degree a ≠ 0, 0' is called strongly noncappable if it has no inf with any incomparable r.e. degree. We show the existence of a high strongly noncappable degree.

After showing the downwards density of nonhemimaximal degrees, Downey and Stob continued to prove that the existence of a low₂, but not low, nonhemimaximal degree, and their proof uses the fact that incomplete m-topped degrees are low₂ but not low. As commented in their paper, the construction of such a nonhemimaximal degree is actually a primitive 0''' argument. In this paper, we give another construction of such degrees, which is a standard 0''-argument, much simpler than Downey and Stob's (...) construction mentioned above. (shrink)

We construct a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma^0_2}$$\end{document}e-degree which is both high and noncuppable. Thus demonstrating the existence of a high e-degree whose predecessors are all properly \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma^0_2}$$\end{document}.

We show that there exist downwards properly $\Sigma _{2}^{0}$ (in fact noncuppable) e-degrees that are not high. We also show that every high e-degree bounds a noncuppable e-degree.

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.

A well-known theorem by Martin asserts that the degrees of maximal sets are precisely the high recursively enumerable degrees, and the same is true with ‘maximal’ replaced by ‘dense simple’, ‘r-maximal’, ‘strongly hypersimple’ or ‘finitely strongly hypersimple’. Many other constructions can also be carried out in any given high r. e. degree, for instance r-maximal or hyperhypersimple sets without maximal supersets . In this paper questions of this type are considered systematically. Ultimately it is shown that every (...) conjunction of simplicity- and non-extensibility properties can be accomplished, unless it is ruled out by well-known, elementary results. Moreover, each construction can be carried out in any given high r. e. degree, as might be expected. For instance, every high r. e. degree contains a dense simple, strongly hypersimple set A which is contained neither in a hyperhypersimple nor in an r-maximal set. The paper also contains some auxiliary results, for instance: every r. e. set B can be transformed into an r. e. set A such that A has no dense simple superset, the transformation preserves simplicity- or non-extensibility properties as far as this is consistent with , and A [TRIPLE BOND]TB if B is high, and A ≥TB otherwise. Several proofs involve refinements of known constructions; relationships to earlier results are discussed in detail. (shrink)

This paper gives an explication of our intuitive notion of strength of justification in a controversial debate. It defines a thesis' degree of justification within the bipolar argumentation framework of the theory of dialectical structures as the ratio of coherently adoptable positions according to which that thesis is true over all coherently adoptable positions. Broadening this definition, the notion of conditional degree of justification, i.e.\ degree of partial entailment, is introduced. Thus defined degrees of justification correspond to (...) our pre-theoretic intuitions in the sense that supporting and defending a thesis t increases, whereas attacking it decreases, t's degree of justification. Moreover, it is shown that (conditional) degrees of justification are (conditional) probabilities. Eventually, the paper explains that it is rational to believe theses with a high degree of justification insofar as this strengthens the robustness of one's position. (shrink)

Agents are often assumed to have degrees of belief (“credences”) and also binary beliefs (“beliefs simpliciter”). How are these related to each other? A much-discussed answer asserts that it is rational to believe a proposition if and only if one has a high enough degree of belief in it. But this answer runs into the “lottery paradox”: the set of believed propositions may violate the key rationality conditions of consistency and deductive closure. In earlier work, we showed that (...) this problem generalizes: there exists no local function from degrees of belief to binary beliefs that satisfies some minimal conditions of rationality and non-triviality. “Locality” means that the binary belief in each proposition depends only on the degree of belief in that proposition, not on the degrees of belief in others. One might think that the impossibility can be avoided by dropping the assumption that binary beliefs are a function of degrees of belief. We prove that, even if we drop the “functionality” restriction, there still exists no local relation between degrees of belief and binary beliefs that satisfies some minimal conditions. Thus functionality is not the source of the impossibility; its source is the condition of locality. If there is any non-trivial relation between degrees of belief and binary beliefs at all, it must be a “holistic” one. We explore several concrete forms this “holistic” relation could take. (shrink)

A λ-theory T is a consistent set of equations between λ-terms closed under derivability. The degree of T is the degree of the set of Godel numbers of its elements. H is the $\lamda$ -theory axiomatized by the set {M = N ∣ M, N unsolvable. A $\lamda$ -theory is sensible $\operatorname{iff} T \supset \mathscr{H}$ , for a motivation see [6] and [4]. In § it is proved that the theory H is ∑ 0 2 -complete. We present (...) Wadsworth's proof that its unique maximal consistent extention $\mathscr{H}^\ast (= \mathrm{T}(D_\infty))$ is Π 0 2 -complete. In $\S2$ it is proved that $\mathscr{H}_\eta(= \lambda_\eta-\text{Calculus} + \mathscr{H})$ is not closed under the ω-rule (see [1]). In $\S3$ arguments are given to conjecture that $\mathscr{H}\omega (= \lambda + \mathscr{H} + omega-rule)$ is Π 1 1 -complete. This is done by representing recursive sets of sequence numbers as λ-terms and by connecting wellfoundedness of trees with provability in Hω. In $\S4$ an infinite set of equations independent over H η will be constructed. From this it follows that there are 2^{ℵ_0 sensible theories T such that $\mathscr{H} \subset T \subset \mathscr{H}^\ast$ and 2 ℵ 0 sensible hard models of arbitrarily high degrees. In $\S5$ some nonprovability results needed in $\S\S1$ and 2 are established. For this purpose one uses the theory H η extended with a reduction relation for which the Church-Rosser theorem holds. The concept of Gross reduction is used in order to show that certain terms have no common reduct. (shrink)

A Polish space is not always homeomorphic to a computably presented Polish space. In this article, we examine degrees of non-computability of presenting homeomorphic copies of compact Polish spaces. We show that there exists a $\mathbf {0}'$ -computable low $_3$ compact Polish space which is not homeomorphic to a computable one, and that, for any natural number $n\geq 2$, there exists a Polish space $X_n$ such that exactly the high $_{n}$ -degrees are required to present the homeomorphism type of (...) $X_n$. Along the way we investigate the computable aspects of Čech homology groups. We also show that no compact Polish space has a least presentation with respect to Turing reducibility. (shrink)

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)

This article explores staff work patterns in an Australian residential aged care facility and the implications for high‐quality care. Rarely available minute by minute, time and motion, and ethnographic data demonstrate that nurses and care staff engage in high degrees of multitasking and mental switching between residents. Mental switching occurs up to 18 times per hour (every 3 min); multitasking occurs on average for 37 min/h. Labor process theory is used to examine these outcomes and to explore the (...) concepts of high demand and high commitment as core components of work intensification. These conditions of work result in high levels of cognitive burden and stress on staff in managing the multitasking and mental switching, exacerbated by lack of knowledge about residents associated with labor force casualization. These new interpretations of data in relation to mental and manual labor can contribute to understanding, and, therefore, problem solving, in the aged care sector. (shrink)

We compare various notions of algorithmic randomness. First we consider relativized randomness. A set is n-random if it is Martin-Löf random relative to ∅. We show that a set is 2-random if and only if there is a constant c such that infinitely many initial segments x of the set are c-incompressible: C ≥ |x|-c. The ‘only if' direction was obtained independently by Joseph Miller. This characterization can be extended to the case of time-bounded C-complexity. Next we prove some results (...) on lowness. Among other things, we characterize the 2-random sets as those 1-random sets that are low for Chaitin's Ω. Also, 2-random sets form minimal pairs with 2-generic sets. The r.e. low for Ω sets coincide with the r.e. K-trivial ones. Finally we show that the notions of Martin-Löf randomness, recursive randomness, and Schnorr randomness can be separated in every high degree while the same notions coincide in every non-high degree. We make some remarks about hyperimmune-free and PA-complete degrees. (shrink)

Visual information conveyed by iconic hand gestures and visible speech can enhance speech comprehension under adverse listening conditions for both native and non‐native listeners. However, how a listener allocates visual attention to these articulators during speech comprehension is unknown. We used eye‐tracking to investigate whether and how native and highly proficient non‐native listeners of Dutch allocated overt eye gaze to visible speech and gestures during clear and degraded speech comprehension. Participants watched video clips of an actress uttering a clear or (...) degraded (6‐band noise‐vocoded) action verb while performing a gesture or not, and were asked to indicate the word they heard in a cued‐recall task. Gestural enhancement was the largest (i.e., a relative reduction in reaction time cost) when speech was degraded for all listeners, but it was stronger for native listeners. Both native and non‐native listeners mostly gazed at the face during comprehension, but non‐native listeners gazed more often at gestures than native listeners. However, only native but not non‐native listeners' gaze allocation to gestures predicted gestural benefit during degraded speech comprehension. We conclude that non‐native listeners might gaze at gesture more as it might be more challenging for non‐native listeners to resolve the degraded auditory cues and couple those cues to phonological information that is conveyed by visible speech. This diminished phonological knowledge might hinder the use of semantic information that is conveyed by gestures for non‐native compared to native listeners. Our results demonstrate that the degree of language experience impacts overt visual attention to visual articulators, resulting in different visual benefits for native versus non‐native listeners. (shrink)

While some form of loss of control is often assumed to be a common feature of the diverse manifestations of addiction, it is far from clear how loss of control should be understood. In this paper, I put forward a concept of decrease in control in addiction that aims to fill this gap and thus provide a general framework for thinking about addictive behavior. The development of this account involves two main steps. First, I present a view of degrees of (...) control as the degree to which an agent would be responsive to potential or counterfactual sufficient reasons to do otherwise. Second, I sketch an account of the relevant control-undermining factors in addiction that is consonant with my proposed view of degrees of control. Being a high-level functional property, reasons-responsiveness is particularly well suited to frame an account of control-undermining factors that is doubly pluralistic: it encompasses the contribution of factors both internal and external to the agent, and it is consistent with various proposals as to the precise nature of the anomaly taking place in the psychology of addiction. (shrink)

We used attractiveness judgements as a proxy to visualize the ideal female and male body for male and female participants and investigated how individual differences in the internalization of cultural ideals influence these representations. In the first of two studies, male and female participants judged the attractiveness of 242 male and female computer-generated bodies which varied independently in muscle and adipose. This allowed us to map changes in attractiveness across the complete body composition space, revealing single peaks for the attractiveness (...) of both men and women. In the second study, we asked our participants to choose the most attractive male and female bodies in a method of adjustment task in which they could independently vary muscle and adipose to create the most attractive body. We asked whether individual differences in internalization of cultural ideals, drive for muscularity, eating disorder symptomatology and depressive symptoms could systematically shift the location of peak attractiveness in body composition space. We found a clear preference by both genders for a male body with high muscle and low adipose, and a toned, low adipose female body. The degree of internalization of cultural ideals predicted large individual differences in the composition of the most attractive bodies. (shrink)

A highly rigid Souslin tree T is constructed such that forcing with T turns T into a Kurepa tree. Club versions of previously known degrees of rigidity are introduced, as follows: for a rigidity property P, a tree T is said to have property P on clubs if for every club set C (containing 0), the restriction of T to levels in C has property P. The relationships between these rigidity properties for Souslin trees are investigated, and some open questions (...) are stated. (shrink)

Background and aim With the increasing interest in lifestyle, health and consequences of unhealthy lifestyles for the healthcare system, a new kind of solidarity is gaining importance: lifestyle solidarity. While it might not seem fair to let other people pay for the costs arising from an unhealthy lifestyle, it does not seem fair either to punish people for their lifestyle. However, it is not clear how solidarity is assessed by people, when considering disease risks or lifestyle risks. The aim of (...) this study was to investigate the degree of solidarity with lifestyle as well as with other factors that are related to health outcomes—for example, old age—and the relation between this degree of solidarity and various characteristics. Methods This cross-sectional study is part of the Dutch longitudinal SMILE study. Data on the degree of solidarity with different lifestyles and old age, and the relation between the degree of solidarity and various demographic and other variables were obtained in a questionnaire survey. Results Solidarity with smokers and overweight people was moderate, as was solidarity with older people. Respondents were ambivalent about athletes. Respondents who were younger, male and highly educated, and those with a healthy lifestyle, a small social network, high quality of life and an internal locus of control, showed low solidarity. Conclusions Solidarity with an unhealthy lifestyle and old age is moderate and the degree of solidarity varies among the different subgroups. (shrink)

People often act in ways that appear incompatible with their sincere assertions. But how might we explain such cases? On the shifting view, subjects’ degrees of belief may be highly sensitive to changes in context. This paper articulates and refines this view, after defending it against recent criticisms. It details two mechanisms by which degrees of beliefs may shift.

We often evaluate belief-forming processes, agents, or entire belief states for reliability. This is normally done with the assumption that beliefs are all-or-nothing. How does such evaluation go when we’re considering beliefs that come in degrees? I consider a natural answer to this question that focuses on the degree of truth-possession had by a set of beliefs. I argue that this natural proposal is inadequate, but for an interesting reason. When we are dealing with all-or-nothing belief, high reliability (...) leads to high levels of truth-possession. However, when it comes to degrees of belief, reliability and truth-possession part ways. The natural answer thus fails to be a good way to evaluate degrees of belief for reliability. I propose and develop an alternative method based on the notion of calibration, suggested by Frank Ramsey, which does not have this problem and consider why we should care about such assessments of reliability even if they are not tied directly to truth-possession. (shrink)

We introduce several highness notions on degrees related to the problem of computing isomorphisms between structures, provided that isomorphisms exist. We consider variants along axes of uniformity, inclusion of negative information, and several other problems related to computing isomorphisms. These other problems include Scott analysis (in the form of back-and-forth relations), jump hierarchies, and computing descending sequences in linear orders.

We investigate various strong notions of rigidity for Souslin trees, separating them under ♢ into a hierarchy. Applying our methods to the automorphism tower problem in group theory, we show under ♢ that there is a group whose automorphism tower is highly malleable by forcing.

According to a suggestion by Williamson, outright belief comes in degrees: one has a high/low degree of belief iff one is willing to rely on the content of one’s belief in high/low-stakes practical reasoning. This paper develops an epistemic norm for degrees of outright belief so construed. Starting from the assumption that outright belief aims at knowledge, it is argued that degrees of belief aim at various levels of strong knowledge, that is, knowledge which satisfies particularly (...) class='Hi'>high epistemic standards. This account is contrasted with and shown to be superior to an alternative proposal according to which higher degrees of outright belief aim at higher-order knowledge. In an “Appendix”, it is indicated that the logic of degrees of outright belief is closely linked to ranking theory. (shrink)

A major problem posed by cases of self-deception concerns the inconsistent behavior of the self-deceived subject (SDS). How can this be accounted for, in terms of propositional attitudes and other mental states? In this paper, we argue that key problems with two recent putative solutions, due to Mele and Archer, are avoided by “the shifting view” that has been advanced elsewhere in order to explain cases where professed beliefs conflict with actions. We show that self-deceived agents may possess highly unstable (...) degrees of belief concerning the matters about which they are self-deceived. (shrink)

A study of the structural perfection of icosahedral quasicrystalline grains of various alloys and Al-Cu-Fe), grown by different slow solidification techniques was performed using high-resolution diffraction, including recording rocking curves combined with X-ray topography and phase contrast radiography, at a third-generation synchrotron radiation source . For Al-Pd-Mn, additional coherent diffraction and diffuse scattering measurements were also carried out. After evaluating the potentialities of the techniques used, in the light of the criteria defined for crystals, it is shown that the (...) structural perfection of icosahedral quasicrystals is quite comparable with that of metallic crystals but is considerably influenced by either uniform phason strains which can destroy the quasiperiodic long-range order, or by long-wavelength phason fluctuations leading to diffuse scattering. The structural perfection was also found to be extremely variable across the as-grown quasicrystalline grains and to be dependent on the presence and characteristics of inhomogeneities often included in the quasicrystalline matrix. Regarding the grains that we used, it has been impossible to distinguish a clear influence of either the type of alloy or the growth method. It has, however, been noticed that Al-Pd-Mn and Al-Cu-Fe grains appeared less defective than Zn-Mg-RE grains and that the microstructure of these latter grains looks like that of crystals grown by the same technique. Annealing and mechanical polishing effects have also been analysed in the case of Al-Pd-Mn grains. It appeared that annealing improves the quasicrystalline lattice perfection by lowering phason strains insofar as no precipitates are nucleated. Mechanical polishing can introduce defects, located at the external surfaces, having the shape of bands. (shrink)

A mass problem is a set of functions $\omega \to \omega $. For mass problems ${\mathcal {C}}, {\mathcal {D}}$, one says that ${\mathcal {C}}$ is Muchnik reducible to ${\mathcal {D}}$ if each function in ${\mathcal {C}}$ is computed by a function in ${\mathcal {D}}$. In this paper we study some highness properties of Turing oracles, which we view as mass problems. We compare them with respect to Muchnik reducibility and its uniform strengthening, Medvedev reducibility.For $p \in [0,1]$ let ${\mathcal {D}}$ (...) be the mass problem of infinite bit sequences y such that for each computable bit sequence x, the bit sequence $ x {\,\leftrightarrow\,} y$ has asymptotic lower density at most p = y$ ). We show that all members of this family of mass problems parameterized by a real p with $0 p$ for each computable set x. We prove that the Medvedev complexity of the mass problems ${\mathcal {B}}$ is the same for all $p \in $, by showing that they are Medvedev equivalent to the mass problem of functions bounded by ${2^{2}}^{n}$ that are almost everywhere different from each computable function.Next, together with Joseph Miller, we obtain a proper hierarchy of the mass problems of type $\text {IOE}$ : we show that for any order function g there exists a faster growing order function $h $ such that $\text {IOE}$ is strictly above $\text {IOE}$ in the sense of Muchnik reducibility.We study cardinal characteristics in the sense of set theory that are analogous to the highness properties above. For instance, ${\mathfrak {d}} $ is the least size of a set G of bit sequences such that for each bit sequence x there is a bit sequence y in G so that $\underline \rho >p$. We prove within ZFC all the coincidences of cardinal characteristics that are the analogs of the results above. (shrink)

This paper focuses on physiological integration in multicellular systems, a notion often associated with biological individuality, but which has not received enough attention and needs a thorough theoretical treatment. Broadly speaking, physiological integration consists in how different components come together into a cohesive unit in which they are dependent on one another for their existence and activity. This paper argues that physiological integration can be understood by considering how the components of a biological multicellular system are controlled and coordinated in (...) such a way that their activities can contribute to the maintenance of the system. The main implication of this perspective is that different ways of controlling their parts may give rise to multicellular organizations with different degrees of integration. After defining control, this paper analyses how control is realized in two examples of multicellular systems located at different ends of the spectrum of multicellularity: biofilms and animals. It focuses on differences in control ranges, and it argues that a high degree of integration implies control exerted at both medium and long ranges, and that insofar as biofilms lack long-range control (relative to their size) they can be considered as less integrated than other multicellular systems. It then discusses the implication of this account for the debate on physiological individuality and the idea that degrees of physiological integration imply degrees of individuality. (shrink)

This study examines the influence of firm governance structures (board size, independence, CEO duality, director share ownership, and board meeting frequency) in relation to carbon emission disclosures by high-polluting Chinses firms. In addition, the study further examined the moderating role of earnings management on this relationship. In line with stakeholder and agency theories, our study identified that the large and independent boards exercise and demonstrate a higher degree of carbon emission disclosures. However, CEO duality and director share ownership (...) are associated with lower carbon emission disclosures. In addition, the study determined that higher earnings management results in a reduced level of carbon emission disclosures. Lastly, a firm earnings management strategy moderates the relationship between a firm governance structure and its carbon emission disclosures. The findings from the study are consistent with multiple econometric models and variables. The findings from the study contribute to the literature in the areas of firm corporate governance and carbon emission disclosures by documenting the moderating role of earnings management, which is not evident in previous studies; provide an enhanced perspective on the implications for firms, regulators, policymakers, and stakeholders who have an interest in reducing carbon emissions and advancing climate change mitigation goals in line with UN's Sustainable Development Goal (SDG) 7: climate action, and zero emissions goal by 2050. (shrink)

Research has demonstrated large differences in the degree to which direct and indirect measures predict each other and variables including behavioural approach and attentional bias. We investigated whether individual differences in the co-variance of “implicit” and “explicit” spider fear exist, and whether this covariation exerts an effect on spider fear-related outcomes. One hundred and thirty-two undergraduate students completed direct and indirect measures of spider fear/avoidance, self-report questionnaires of psychopathology, an attentional bias task, and a proxy Behavioural Approach Task. TwoStep (...) cluster analysis using implicit and explicit spider fear as criterion variables resulted in three clusters: low explicit/low implicit; average explicit/high implicit; and high explicit/low implicit. Clusters with higher explicit fear demonstrated greater disgust propensity and sensitivity and less willingness to approach a spider. No differences between clusters emerged on anticipatory approach anxiety or attentional bias. We discuss results in terms of dual-systems and cognitive–behavioural models of fear. (shrink)

We study the degrees of unsolvability of sets which are cohesive . We answer a question raised by the first author in 1972 by showing that there is a cohesive set A whose degree a satisfies a' = 0″ and hence is not high. We characterize the jumps of the degrees of r-cohesive sets, and we show that the degrees of r-cohesive sets coincide with those of the cohesive sets. We obtain analogous results for strongly hyperimmune and strongly (...) hyperhyperimmune sets in place of r-cohesive and cohesive sets, respectively. We show that every strongly hyperimmune set whose degree contains either a Boolean combination of ∑2 sets or a 1-generic set is of high degree. We also study primitive recursive analogues of these notions and in this case we characterize the corresponding degrees exactly. MSC: 03D30, 03D55. (shrink)

What is the interplay of high-tech industrial agglomeration and urban innovation? How does high-tech industrial agglomeration affect urban innovation? What are the heterogeneous effects of high-tech industry agglomeration on urban innovation in different conditions? To answer these questions, this paper analyzes the interrelationship between high-tech industry agglomeration and urban innovation based on panel data of China’s Yangtze River Delta urban agglomeration from 2010 to 2019. We discuss the influence mechanism of high-tech industrial agglomeration on urban (...) innovation by exploring the mediating effect of industrial structure optimization and the threshold effect of industrial attributes. The heterogeneous impact of high-tech industry agglomeration on urban innovation is also been further studied. We find that the interaction relationship between high-tech industry agglomeration and urban innovation output is positive. The advancement of industrial structure plays a positive intermediary role between high-tech industrial agglomeration and urban innovation output, while the rationalization of industrial structure shows a suppressing effect. There are different threshold effects between capital intensity and technology intensity. The influence of high-tech agglomeration on urban innovation is positive only when the capital intensity exceeds 1.125. However, the influence is always positive in different levels of technology intensity, significantly. When the technology intensity is higher than 9.012E − 06, the degree and significance of this positive impact would decrease. There are heterogeneous impacts of high-tech industry agglomeration on urban innovation output in the Yangtze River Delta urban agglomeration in different time stages, urban innovation development stages, and urban circles. (shrink)

A central question for ontology is the question of whether numbers really exist. But it seems easy to answer this question in the affirmative. The truth of a sentence like ‘Seven students came to the party’ can be established simply by looking around at the party and counting students. A trivial paraphrase of is ‘The number of students who came to the party is seven’. But appears to entail the existence of a number, and so it seems that we must (...) conclude that numbers exist. This is sometimes called the puzzle of how we can get something from nothing. Most extant attempts to solve the puzzle take it for granted that is ontologically innocent, and focus their attention either on or on the transition from to. We argue that both attempts go wrong at the first step: the assumption that is ontologically innocent is undermined by a highly attractive and independently well-motivated degree-based account of number word constructions. Thus the degree-based account provides a straightforward linguistic resolution of the puzzle of how we can get something from nothing. But the paper also has a second aim. The semantics we present treats ‘seven’ as a referring expression that refers to a degree of a certain sort. But what are degrees? We consider various anti-platonist proposals that seek to account for degrees in terms of relations between concrete entities, and argue that they are incompatible with the Universal Density of Measurement hypothesis of Fox and Hackl. While the UDM cannot yet claim to be the consensus view among degree-based semanticists, our aim is to use it to illustrate how views about the nature of degrees can be evaluated by considering the properties degrees must have if they are to play the explanatory roles they are called upon to play in linguistics. In the present state of development of degree-based semantics there are difficult open questions about what these properties are. These questions need to be addressed if we are to develop a clear picture of what natural language semantics has to contribute to ontology and metaphysics. (shrink)

We introduce a new hierarchy of computably enumerable degrees. This hierarchy is based on computable ordinal notations measuring complexity of approximation of${\rm{\Delta }}_2^0$functions. The hierarchy unifies and classifies the combinatorics of a number of diverse constructions in computability theory. It does so along the lines of the high degrees (Martin) and the array noncomputable degrees (Downey, Jockusch, and Stob). The hierarchy also gives a number of natural definability results in the c.e. degrees, including a definable antichain.

Relationships between degree/area of academic formation and religious and Darwinian views are controversial. This study aimed to compare the religious beliefs and acceptance of Darwinian evolution between two contrasting South American scientific communities (Chile and Colombia), accounting for different degrees and areas of academic formation. In 2018, 115 last year bachelor students (surveyed as freshmen in 2014 for a previous study) from Chile, and 283 first/last year bachelor students, graduate students, and professors from Colombia, all belonging to biology, chemistry, (...) or physics, were surveyed. Chilean students/faculty were significantly more agnostic/atheist, more accepting of Darwinian evolution, and less creationist than their Colombian counterparts. Academic degree and area differently affected these views in both countries, as only in Chile there was a clear tendency among biologists and physicists with higher degrees to hold less religious and creationist views. Marked differences between the history, socioeconomic contexts, and especially in high school and university curricula of both countries might explain these results. (shrink)

In this paper, we improve a result of Seetapun and prove that above any nonzero, incomplete recursively enumerable degree a, there is a high2 r.e. degree c>ac>a witnessing that a is locally noncappable . Theorem 1.1 provides a scheme of obtaining high2 nonboundings , as all known high2 nonboundings, such as high2 degrees bounding no minimal pairs, high2 plus-cuppings, etc.