Defining the degree of categoricity of a computable structure ${\mathcal{M}}$ to be the least degree d for which ${\mathcal{M}}$ is d-computably categorical, we investigate which Turing degrees can be realized as degrees of categoricity. We show that for all n, degrees d.c.e. in and above 0 (n) can be so realized, as can the degree 0 (ω).

We study arithmetic and hyperarithmetic degrees of categoricity. We extend a result of E. Fokina, I. Kalimullin, and R. Miller to show that for every computable ordinal $\alpha$, $\mathbf{0}^{}$ is the degree of categoricity of some computable structure $\mathcal{A}$. We show additionally that for $\alpha$ a computable successor ordinal, every degree $2$-c.e. in and above $\mathbf{0}^{}$ is a degree of categoricity. We further prove that every degree of categoricity is hyperarithmetic and show (...) that the index set of structures with degrees of categoricity is $\Pi_{1}^{1}$-complete. (shrink)

A Turing degreedis the degree of categoricity of a computable structure${\cal S}$ifdis the least degree capable of computing isomorphisms among arbitrary computable copies of${\cal S}$. A degreedis the strong degree of categoricity of${\cal S}$ifdis the degree of categoricity of${\cal S}$, and there are computable copies${\cal A}$and${\cal B}$of${\cal S}$such that every isomorphism from${\cal A}$onto${\cal B}$computesd. In this paper, we build a c.e. degreedand a computable rigid structure${\cal M}$such thatdis the degree of categoricity (...) of${\cal M}$, butdis not the strong degree of categoricity of${\cal M}$. This solves the open problem of Fokina, Kalimullin, and Miller [13].For a computable structure${\cal S}$, we introduce the notion of the spectral dimension of${\cal S}$, which gives a quantitative characteristic of the degree of categoricity of${\cal S}$. We prove that for a nonzero natural numberN, there is a computable rigid structure${\cal M}$such that$0\prime$is the degree of categoricity of${\cal M}$, and the spectral dimension of${\cal M}$is equal toN. (shrink)

We investigate the complexity of isomorphisms of computable structures on cones in the Turing degrees. We show that, on a cone, every structure has a strong degree of categoricity, and that degree of categoricity is${\rm{\Delta }}_\alpha ^0 $-complete for someα. To prove this, we extend Montalbán’sη-system framework to deal with limit ordinals in a more general way. We also show that, for any fixed computable structure, there is an ordinalαand a cone in the Turing degrees such (...) that the exact complexity of computing an isomorphism between the given structure and another copy${\cal B}$in the cone is a c.e. degree in${\rm{\Delta }}_\alpha ^0\left$. In each of our theorems the cone in question is clearly described in the beginning of the proof, so it is easy to see how the theorems can be viewed as general theorems with certain effectiveness conditions. (shrink)

In this paper, we give a characterization of the strong degrees of categoricity of computable structures greater or equal to [Formula: see text]. They are precisely the treeable degrees — the least degrees of paths through computable trees — that compute [Formula: see text]. As a corollary, we obtain several new examples of degrees of categoricity. Among them we show that every degree [Formula: see text] with [Formula: see text] for [Formula: see text] a computable ordinal greater (...) than [Formula: see text] is the strong degree of categoricity of a rigid structure. Using quite different techniques we show that every degree [Formula: see text] with [Formula: see text] is the strong degree of categoricity of a structure. Together with the above example this answers a question of Csima and Ng. To complete the picture we show that there is a degree [Formula: see text] with [Formula: see text] that is not the degree of categoricity of a rigid structure. (shrink)

A computable structure $\mathcal {A}$ is $\mathbf {x}$-computably categorical for some Turing degree $\mathbf {x}$ if for every computable structure $\mathcal {B}\cong\mathcal {A}$ there is an isomorphism $f:\mathcal {B}\to\mathcal {A}$ with $f\leq_{T}\mathbf {x}$. A degree $\mathbf {x}$ is a degree of categoricity if there is a computable structure $\mathcal {A}$ such that $\mathcal {A}$ is $\mathbf {x}$-computably categorical, and for all $\mathbf {y}$, if $\mathcal {A}$ is $\mathbf {y}$-computably categorical, then $\mathbf {x}\leq_{T}\mathbf {y}$. We construct a (...) $\Sigma^{0}_{2}$ set whose degree is not a degree of categoricity. We also demonstrate a large class of degrees that are not degrees of categoricity by showing that every degree of a set which is 2-generic relative to some perfect tree is not a degree of categoricity. Finally, we prove that every noncomputable hyperimmune-free degree is not a degree of categoricity. (shrink)

In this paper, we show that for any computable ordinal α, there exists a computable tree of rank with strong degree of categoricity if α is finite, and with strong degree of categoricity if α is infinite. In fact, these are the greatest possible degrees of categoricity for such trees. For a computable limit ordinal α, we show that there is a computable tree of rank α with strong degree of categoricity (which equals (...) ). It follows from our proofs that, for every computable ordinal, the isomorphism problem for trees of rank α is ‐complete. (shrink)

It is shown that for every Turing degree d there is an ω-categorical group G such that the isomorphism type of G is of degree d. We also find an ω-categorical group G such that the isomorphism type of G has no degree.

A strong degree of categoricity is a Turing degree [Formula: see text] such that there is a computable structure [Formula: see text] that is [Formula: see text]-computably categorical (there is a [Formula: see text]-computable isomorphism between any two computable copies of [Formula: see text]), and such that there exist two computable copies of [Formula: see text] between which every isomorphism computes [Formula: see text]. The question of whether every [Formula: see text] degree is a strong (...) class='Hi'>degree of categoricity has been of interest since the first paper on this subject. We answer the question in the affirmative, by constructing an example. (shrink)

We investigate the complexity of embeddings between bi-embeddable structures. In analogy with categoricity spectra, we define the bi-embeddable categoricity spectrum of a structure A as the family of Turing degrees that compute embeddings between any computable bi-embeddable copies of A; the degree of bi-embeddable categoricity of A is the least degree in this spectrum (if it exists). We extend many known results about categoricity spectra to the case of bi-embeddability. In particular, we exhibit structures (...) without degree of bi-embeddable categoricity, and we show that every degree d.c.e above 0(α) for α a computable successor ordinal and 0(λ) for λ a computable limit ordinal is a degree of bi-embeddable categoricity. We also give examples of families of degrees that are not bi-embeddable categoricity spectra. (shrink)

We study the algorithmic complexity of embeddings between bi-embeddable equivalence structures. We define the notions of computable bi-embeddable categoricity, \ bi-embeddable categoricity, and degrees of bi-embeddable categoricity. These notions mirror the classical notions used to study the complexity of isomorphisms between structures. We show that the notions of \ bi-embeddable categoricity and relative \ bi-embeddable categoricity coincide for equivalence structures for \. We also prove that computable equivalence structures have degree of bi-embeddable categoricity (...) \, or \. We furthermore obtain results on the index set complexity of computable equivalence structure with respect to bi-embeddability. (shrink)

Nick Huggett and Robert Weingard (1994) have recently proposed a novel approach to interpreting field theories in physics, one which makes central use of the fact that a field generally has an infinite number of degrees of freedom in any finite region of space it occupies. Their characterization, they argue, (i) reproduces our intuitive categorizations of fields in the classical domain and thereby (ii) provides a basis for arguing that the quantum field is a field. Furthermore, (iii) it accomplishes these (...) tasks better than does a well-known rival approach due to Paul Teller (1990, 1995). This paper contends that all three of these claims are mistaken, and suggests that Huggett and Weingard have not shown how counting degrees of freedom provides any insight into the interpretation or the formal properties of field theories in physics. (shrink)

For a computable structure $\mathcal {M}$, the categoricity spectrum is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable copies of $\mathcal {M}$. If the spectrum has a least degree, this degree is called the degree of categoricity of $\mathcal {M}$. In this paper we investigate spectra of categoricity for computable rigid structures. In particular, we give examples of rigid structures without degrees of categoricity.

The concept of “life” certainly is of some use to distinguish birds and beavers from water and stones. This pragmatic usefulness has led to its construal as a categorical predicate that can sift out living entities from non-living ones depending on their possessing specific properties—reproduction, metabolism, evolvability etc. In this paper, we argue against this binary construal of life. Using text-mining methods across over 30,000 scientific articles, we defend instead a degrees-of-life view and show how these methods can contribute to (...) experimental philosophy of science and concept explication. We apply topic-modeling algorithms to identify which specific properties are attributed to a target set of entities (bacteria, archaea, viruses, prions, plasmids, phages and the molecule of adenine). Eight major clusters of properties were identified together with their relative relevance for each target entity (two that relate to metabolism and catalysis, one to genetics, one to evolvability, one to structure, and—rather unexpectedly—three that concern interactions with the environment broadly construed). While aligning with intuitions—for instance about viruses being less alive than bacteria—these quantitative results also reveal differential degrees of performance that have so far remained elusive or overlooked. Taken together, these analyses provide a conceptual “lifeness space” that makes it possible to move away from a categorical construal of life by empirically assessing the relative lifeness of more-or-less alive entities. (shrink)

During public health crises including the COVID-19 pandemic, resource scarcity and contagion risks may require health systems to shift—to some degree—from a usual clinical ethic, focused on the well-being of individual patients, to a public health ethic, focused on population health. Many triage policies exist that fall under the legal protections afforded by “crisis standards of care,” but they have key differences. We critically appraise one of the most fundamental differences among policies, namely the use of criteria to categorically (...) exclude certain patients from eligibility for otherwise standard medical services. We examine these categorical exclusion criteria from ethical, legal, disability, and implementation perspectives. Focusing our analysis on the most common type of exclusion criteria, which are disease-specific, we conclude that optimal policies for critical care resource allocation and the use of cardiopulmonary resuscitation (CPR) should not use categorical exclusions. We argue that the avoidance of categorical exclusions is often practically feasible, consistent with public health norms, and mitigates discrimination against persons with disabilities. (shrink)

We describe punctual categoricity in several natural classes, including binary relational structures and mono-unary functional structures. We prove that every punctually categorical structure in a finite unary language is${\text {PA}}(0')$-categorical, and we show that this upper bound is tight. We also construct an example of a punctually categorical structure whose degree of categoricity is$0''$. We also prove that, with a bit of work, the latter result can be pushed beyond$\Delta ^1_1$, thus showing that punctually categorical structures can (...) possess arbitrarily complex automorphism orbits.As a consequence, it follows that binary relational structures and unary structures are not universal with respect to primitive recursive interpretations; equivalently, in these classes every rich enough interpretation technique must necessarily involve unbounded existential quantification or infinite disjunction. In contrast, it is well-known that both classes are universal for Turing computability. (shrink)

The spectrum of a relation on a computable structure is the set of Turing degrees of the image of R under all isomorphisms between and any other computable structure . The relation is intrinsically computably enumerable if its image under all such isomorphisms is c.e. We prove that any computable partially ordered set is isomorphic to the spectrum of an intrinsically c.e. relation on a computable structure. Moreover, the isomorphism can be constructed in such a way that the image of (...) the minimum element of the partially ordered set is computable. This solves the spectrum problem. The theorem and modifications of its proof produce computably categorical structures whose expansions by finite number of constants are not computably categorical and, indeed, ones whose expansions can have any finite number of computable isomorphism types. They also provide examples of computably categorical structures that remain computably categorical under expansions by constants but have no Scott family. (shrink)

The Russian intuitivist philosopher Nikolay Lossky repeatedly admitted Kant’s substantial formative influence on him as a scholar. Moreover, Lossky was a disciple of the Russian Kantian Aleksander Vvedensky, and was one of the most successful translators of the first Critique. However, his own philosophical project is rather the opposite of the critical programme. While in the framework of Lossky’s epistemology the specificities of his reading of Kant have received a fair amount of attention in Russian scholarship, in the ethical field (...) the Russian philosopher’s comments on Kant have passed largely unnoticed. My task is to reveal the link between Kant’s practical philosophy and Lossky’s ethics. A demonstration of the degree of Kant’s influence in this field will enlarge and concretise the current thinking about Lossky’s perception of Kant. We are looking at a whole range of parallels and borrowings. My comparative analysis focuses on the following aspects: 1) definition and uses of the term “categorical imperative”, 2) free will as the condition of the possibility of moral action, 3) the cause of moral evil, 4) the role of the idea of God in ethics. As a result, I reveal how Lossky used elements of Kant’s practical philosophy as conceptual, terminological and rhetorical resources in his theonomic ethics, and how the Russian philosopher interpreted them in line with his own doctrine. I argue that Lossky’s use of the Kantian moral terminology is incautious and debatable and point out several intersections of ethical argumentations in the light of its projection on radically different ontological and epistemological principles. (shrink)

We give some new examples of possible degree spectra of invariant relations on Δ 0 2 -categorical computable structures, which demonstrate that such spectra can be fairly complicated. On the other hand, we show that there are nontrivial restrictions on the sets of degrees that can be realized as degree spectra of such relations. In particular, we give a sufficient condition for a relation to have infinite degree spectrum that implies that every invariant computable relation on a (...) Δ 0 2 -categorical computable structure is either intrinsically computable or has infinite degree spectrum. This condition also allows us to use the proof of a result of Moses [23] to establish the same result for computable relations on computable linear orderings. We also place our results in the context of the study of what types of degree-theoretic constructions can be carried out within the degree spectrum of a relation on a computable structure, given some restrictions on the relation or the structure. From this point of view we consider the cases of Δ 0 2 -categorical structures, linear orderings, and 1-decidable structures, in the last case using the proof of a result of Ash and Nerode [3] to extend results of Harizanov [14]. (shrink)

Using new techniques for controlling the categoricity spectrum of a structure, we construct a structure with degree of categoricity but infinite spectral dimension, answering a question of Bazhenov, Kalimullin and Yamaleev. Using the same techniques, we construct a computably categorical structure of non-computable Scott rank.

This essay discusses the difficulty to reconcile two paradigms about beliefs: the binary or categorical paradigm of yes/no beliefs and the probabilistic paradigm of degrees of belief. The possibility for someone to hold both types of belief simultaneously is challenged by the lottery paradox, and more recently by a general impossibility theorem by Dietrich and List (2018, 2021). The nature, relevance, and implications of the tension are explained and assessed.

We argue that the basic notions of mathematics can only be properly formulated in an informal way. Mathematical notions transcend formalizations and their study involves the consideration of other mathematical notions. We explain the fundamental role of categoricity theorems in making these studies possible. We arrive at the conclusion that the enterprise of mathematics is not infallible and that it ultimately relies on degrees of evidence.

The ethics of Kant and the ethics of Crusius are strikingly similar. This is manifested in a whole range of principles and concepts. Crusius’ moral teaching hinges on the rigorous moral law which has to be obeyed absolutely, and which makes it different from other prescriptions that are binding only to a relative degree. This is very close to the Kantian distinction between hypothetical and categorical imperatives. Another salient feature of Crusius’ moral teaching is the stress laid on the (...) sphere of internal motives. It is the inner motive that determines the morality of an act, rather than the external form of the act. These and some other features of Crusius’ ethics suggest a possible influence of Crusius on Kant. The possibility of such influence has repeatedly come under close scrutiny. The first works devoted to this problem date to the turn of the nineteenth and twentieth centuries. Pointers to the possibility of such influence are semantic and structural similarities of the two thinkers’ systems. Besides, it is an unchallengeable fact that Kant was fairly familiar with the main theses of Crusian philosophy. Some scholars proceed from the study of Kantian vocabulary. Some of the terms Kant uses, especially in his early works which later formed the basis of his ethical teaching in the critical period, can be traced to the terms of Crusian philosophy. However, an alternative view is that Kant was primarily influenced by Wolffian philosophy (mainly through Baumgarten), while the direct influence of Crusius remains unproven. I examine both points of view and propose my own solution to the problem. (shrink)

We investigate effective categoricity for polymodal algebras. We prove that the class of polymodal algebras is complete with respect to degree spectra of nontrivial structures, effective dimensions, expansion by constants, and degree spectra of relations. In particular, this implies that every categoricity spectrum is the categoricity spectrum of a polymodal algebra.

We provide here the first steps toward a Classification Theory ofElementary Classes with no maximal models, plus some mild set theoretical assumptions, when the class is categorical in some λ greater than its Löwenheim-Skolem number. We study the degree to which amalgamation may be recovered, the behaviour of non μ-splitting types. Most importantly, the existence of saturated models in a strong enough sense is proved, as a first step toward a complete solution to the o Conjecture for these classes. (...) Further results are in preparation. (shrink)

Whenever a structure with a particularly interesting computability-theoretic property is found, it is natural to ask whether similar examples can be found within well-known classes of algebraic structures, such as groups, rings, lattices, and so forth. One way to give positive answers to this question is to adapt the original proof to the new setting. However, this can be an unnecessary duplication of effort, and lacks generality. Another method is to code the original structure into a structure in the given (...) class in a way that is effective enough to preserve the property in which we are interested. In this paper, we show how to transfer a number of computability-theoretic properties from directed graphs to structures in the following classes: symmetric, irreflexive graphs; partial orderings; lattices; rings ; integral domains of arbitrary characteristic; commutative semigroups; and 2-step nilpotent groups. This allows us to show that several theorems about degree spectra of relations on computable structures, nonpreservation of computable categoricity, and degree spectra of structures remain true when we restrict our attention to structures in any of the classes on this list. The codings we present are general enough to be viewed as establishing that the theories mentioned above are computably complete in the sense that, for a wide range of computability-theoretic nonstructure type properties, if there are any examples of structures with such properties then there are such examples that are models of each of these theories. (shrink)

We use the Low Basis Theorem of Jockusch and Soare to show that all computable algebraic fields are d-computably categorical for a particular Turing degree d with d' = θ", but that not all such fields are 0'-computably categorical. We also prove related results about algebraic fields with splitting algorithms, and fields of finite transcendence degree over ℚ.

The doctrine of the moral equality of combatants holds that combatants on either side of a war have equal moral status, even if one side is fighting a just war while the other is not. This chapter examines arguments that have been offered for and against this doctrine, including the collectivist position famously articulated by Walzer and McMahan’s influential individualist critique. We also explore collectivist positions that have rejected the moral equality doctrine and arguments that some individualists have offered in (...) its favor. We defend a non-categorical version of the moral equality doctrine, according to which combatants on either side of a just war sometimes (but not always) have equal moral status. On our view, some degree of culpability is necessary for liability, and non-culpable combatants may therefore sometimes remain non-liable even when they fight for an unjust cause. (shrink)

Darwin claimed that human and animal minds differ in degree but not in kind, and that ethical principles such as the Golden Rule are just an extension of thinking found in animals. Both claims are false. The best way to distinguish differences in degree from differences in kind is by identifying mechanisms that have emergent properties. Recursive thinking is an emergent capability found in humans but not in other animals. The Golden Rule and some other ethical principles such (...) as Kant’s categorical imperative require recursion, so they constitute ethical thinking that is restricted to humans. Changes in kind have tipping points resulting from mechanisms with emergent properties. (shrink)

Transnational higher education (TNHE) has been characterised as a crude form of market-driven internationalisation, often targeting immobile student populations in countries with high demand for international academic degrees. In response to recent scholarship on the role of higher education internationalisation in facilitating and producing diasporic networks, this study examines its inverse: how TNHE services existing diasporic communities in situ by mobilising institutions across borders rather than student bodies. It specifically examines these dynamics within the United Arab Emirates (UAE), simultaneously host (...) to one of the largest concentrations of TNHE globally and a five million-member diasporic community of long-term, yet impermanent residents from South Asia. Drawing on interviews with South Asian students in undergraduate degree programmes at three British international branch campuses (IBCs), it explores how students perceive their IBCs as strategic sources of valuable degree capitals for enhancing employment opportunities in the UAE and securing against precarity and uncertain futures as perpetually impermanent residents. The research implicates the role of TNHE in diaspora policymaking, asking how IBCs function as an extension of a limited social contract between a diasporic community and its ‘host’ state. (shrink)

This paper examines the concept of ‘openness with patients’ from the stand-point of the limitations of biomedical ethics. Initially we review contemporary critiques of bioethics and, in particular, of principlism; we relate how other; somewhat neglected, forms of medical ethics can yield useful information and provide moral guidance. The main section of the paper then shows how a bioethical approach to openness misses the social context in our example, the viewpoints of patients; we present some of the increasing wealth of (...) research evidence which points towards patients wanting more information and a greater degree of openness. (shrink)

The quality of doctoral-level biochemistry (N=139), botany (N=83), cellular/molecular biology (N=89), microbiology (N=134), physiology (N=101), and zoology (N=70) programs at United States universities was assessed, using 16 measures. These measures focused on variables related to: (1) program size; (2) characteristics of graduates; (3) reputational factors (scholarly quality of faculty, effectiveness of programs in educating research scholars/scientists, improvement in program quality during the last 5 years); (4) university library size; (5) research support; and (6) publication records. Chapter I discusses prior attempts (...) to assess quality in graduate education, development of the study plans, and the selection of disciplines and programs to be evaluated. Chapter II discusses the methodology used, focusing on each of the assessment measures. Chapters III to VIII present, respectively, findings from the analyses of the biochemistry, botany, cellular/molecular biology, microbiology, physiology, and zoology programs. Chapter IX includes a summary of results, correlations among measures, several additional analyses, and suggestions for future studies. Among the findings reported are those indicating that cellular/molecular biology programs had, on the average, the largest number of faculty and that students in cellular/molecular biology, biology, biochemistry, microbiology, and physiology received a relatively high fraction of financial support. (Survey instruments and supporting documentation are included in appendices.) (JN). (shrink)

The quality of doctoral-level chemistry (N=145), computer science (N=58), geoscience (N=91), mathematics (N=115), physics (N=123), and statistics/biostatistics (N=64) programs at United States universities was assessed, using 16 measures. These measures focused on variables related to: program size; characteristics of graduates; reputational factors (scholarly quality of faculty, effectiveness of programs in educating research scholars/scientists, improvement in program quality during the last 5 years); university library size; research support; and publication records. Chapter I discusses prior attempts to assess quality in graduate education, (...) development of the study plans, and the selection of disciplines and programs to be evaluated. Chapter II discusses the methodology used, focusing on each of the assessment measures. Chapters III to VIII present, respectively, findings from the analyses of the chemistry, computer science, geoscience, mathematics, physics, and statistics/biostatistics programs. Chapter IX includes a summary of results, correlations among measures, several additional analyses, and suggestions for future studies. Among the findings reported are those indicating that mathematics programs had, on the average, the largest number of faculty (N=33) in December 1980 followed closely by physics (N=28) and chemistry (N=23), and that 80 percent of computer science students had job commitments by graduation. (Survey instruments and supporting documentation are included in appendices.) (JN). (shrink)

We regularly make graded normative judgements in the epistemic domain. Recent work in the literature examines degrees of justification, degrees of rationality, and degrees of assertability. This paper addresses a different dimension of the gradeability of epistemic normativity, one that has been given little attention. How should we understand degrees of epistemic criticizability? In virtue of what sorts of factors can one epistemic failing be worse than another? The paper develops a dual-factor view of degrees of epistemic criticizability. According to (...) the view, degrees of epistemic criticizability are (i) an inverse function of degrees of doxastic justification and (ii) a function of degrees of agent culpability. The paper develops an account of each factor, and explains how they should be weighted. The paper also addresses the importance of modelling degrees of epistemic criticizability in a broader context. I focus on the role that such a model can play in the ethics of epistemic criticism. (shrink)

n this paper, a non-classical axiomatic system was introduced to classify all moods of Aristotelian syllogisms, in addition to the axiom "Every a is an a" and the bilateral rules of obversion of E and O propositions. This system consists of only 2 definitions, 2 axioms, 1 rule of a premise, and moods of Barbara and Datisi. By adding first-degree propositional negation to this system, we prove that the square of opposition holds without using many of the other rules (...) of classical logic (including double negation elimination). We then show that the Propositional Substructural Logic SLe is the best logic to study Aristotelian Syllogisms. Also, based on the IFLe square of opposition, the rules of conversation and the rules of negation are completely proved in Muzaffar's logic. For this purpose, we used the monadic first-order logic with the same standard deductive apparatus of quantifiers in classical logic, plus the axioms of "some a is an a" and "some not-a is a not-a". Finally, to show that there is no existential commitment to general terms in categorical logic, the Strong Four-Valued Relevant-classical Logic KR4 was used. With the same existential interpretation of the quantifiers and the standard translation of the quarter quantified. (shrink)

This paper examines the concept of ‘openness with patients’ from the stand-point of the limitations of biomedical ethics. Initially we review contemporary critiques of bioethics and, in particular, of principlism; we relate how other; somewhat neglected, forms of medical ethics can yield useful information and provide moral guidance.The main section of the paper then shows how a bioethical approach to openness misses the social context in our example, the viewpoints of patients; we present some of the increasing wealth of research (...) evidence which points towards patients wanting more information and a greater degree of openness.Finally we put forward that a principlist’s objection to active encouragement of openness might be based on the risk of infringing upon the ‘right not to know’. We reject this by arguing how rights can be trumped. (shrink)

ObjectiveTo investigate the effects of cell phone dependence on mental health among undergraduates during the COVID-19 pandemic and further identify the determinants that may affect their mental health in China.MethodsThe data were collected from 602 students at a medical school in Shanghai via an online survey conducted from December 2021 to February 2022. The Mobile Phone Addiction Index and Depression Anxiety Stress Scale were applied to evaluate CPD and mental health, respectively. Independent sample t-test and one-way analysis of variance were (...) employed to compare the means of continuous variables among categorical groups. Correlations between continuous variables were detected using Pearson's correlation analysis. Univariable and multivariable logistic regressions were employed to identify the determinants of mental health.ResultsAmong the 402 eligible students, 73.88% were women with an average age of 20.19 ± 2.36 years. On average, the DASS score was 32.20 ± 11.07, the CPD score was 36.23 ± 11.89, and the cell phone use duration was 7.67 ± 3.61 h/day. CPD was found to have a negative effect on mental health among college students in Shanghai. Additionally, cell phone use duration, age, being senior students, faculty-student relationship, insomnia, tobacco use, obesity, and life satisfaction were clarified as contributing factors to mental health among college students.ConclusionHigh degree of CPD could have a negative effect on college students' mental health, which might lead to some psychological problems. Appropriate actions and effective interventions are highly needed to prevent severe psychological injuries among college students in China. (shrink)

Doctoral programs at U.S. universities play a critical role in the development of human resources both in the United States and abroad. This volume reports the results of an extensive study of U.S. research-doctorate programs in five broad fields: physical sciences and mathematics, engineering, social and behavioral sciences, biological sciences, and the humanities. Research-Doctorate Programs in the United States documents changes that have taken place in the size, structure, and quality of doctoral education since the widely used 1982 editions. This (...) update provides selected information on nearly 4,000 doctoral programs in 41 subdisciplines at 274 doctorate-granting institutions. This volume also reports the results of the National Survey of Graduate Faculty, which polled a sample of faculty for their views on the scholarly quality of program faculty and the effectiveness of doctoral programs in preparing research scholars/scientists. This much-anticipated update of such an essential reference will be useful to education administrators, university faculty, and students seeking authoritative information on doctoral programs. (shrink)

In this paper, I appeal to two aspects of Immanuel Kant’s philosophy – his metaphysics and ethics – in defense of abortion rights. Many Kantian pro-life philosophers argue that Kant’s second principle formulation of the categorical imperative, which proscribes treating persons as mere means, applies to human embryos and fetuses. Kant is clear, however, that he means his imperatives to apply to persons, individuals of a rational nature. It is important to determine, therefore, whether there is anything in Kant’s philosophy (...) that permits regarding embryos and fetuses as persons, since they lack the capacity for sentience (at least until mid-gestation), let alone rational thought. In the first part of the paper, I will illustrate why there are difficulties maintaining, from a Kantian perspective, that conception marks the genesis of a new person. Even granting that embryos and fetuses are persons, however, this alone would not entail the moral impermissibility of abortion rights, mainly because prohibiting abortion, and compelling women to gestate, violates the formula of humanity against them. Developing this thesis encompasses the second part of my essay. Finally, although I argue that Kant’s philosophy lends strong support to abortion rights, this does not thereby entail that it allows for the complete dehumanization of the human fetus. By appealing to the writings of Kantian scholar Allen Wood, I will argue that a fetus’ status as a potential person does render it worthy of some degree of respect and moral value. (shrink)

Is a human more conscious than an octopus? In the science of consciousness, it’s oftentimes assumed that some creatures (or mental states) are more conscious than others. But in recent years, a number of philosophers have argued that the notion of degrees of consciousness is conceptually confused. This paper (1) argues that the most prominent objections to degrees of consciousness are unsustainable, (2) examines the semantics of ‘more conscious than’ expressions, (3) develops an analysis of what it is for a (...) degreed property to count as degrees of consciousness, and (4) applies the analysis to various theories of consciousness. I argue that whether consciousness comes in degrees ultimately depends on which theory of consciousness turns out to be correct. But I also argue that most theories of consciousness entail that consciousness comes in degrees. (shrink)

A first-order structure $\mathfrak {A}$ is called monadically stable iff every expansion of $\mathfrak {A}$ by unary predicates is stable. In this paper we give a classification of the class $\mathcal {M}$ of $\omega $ -categorical monadically stable structure in terms of their automorphism groups. We prove in turn that $\mathcal {M}$ is the smallest class of structures which contains the one-element pure set, is closed under isomorphisms, and is closed under taking finite disjoint unions, infinite copies, and finite index (...) first-order reducts. Using our classification we show that every structure in $\mathcal {M}$ is first-order interdefinable with a finitely bounded homogeneous structure. We also prove that every structure in $\mathcal {M}$ has finitely many reducts up to interdefinability, thereby confirming Thomas’ conjecture for the class $\mathcal {M}$. (shrink)

Let us agree that everything that there is exists, and that to be, to be real, and to exist are one and the same. Does everything that there is exist to the same degree? Or do some things exist more than others? Are there gradations of being? I argue that some entities exist more than others. Moreover, many of the notions in play in contemporary metaphysical discourse, such as fundamentality, perfect naturalness, and grounding ought to be cashed out in (...) terms of degree of existence. (shrink)