We construct a recursive model , a recursive subset R of its domain, and a Turing degree x 0 satisfying the following condition. The nonrecursive images of R under all isomorphisms from to other recursive models are of Turing degree x and cannot be recursively enumerable.

We analyze the degree spectra of structures in which different types of immunity conditions are encoded. In particular, we give an example of a structure whose degree spectrum coincides with the hyperimmune degrees. As a corollary, this shows the existence of an almost computable structure of which the complement of the degree spectrum is uncountable.

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)

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)

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)

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 (ω).

Autism spectrum disorders (ASDs) are an issue of growing public health significance. This set of neurodevelopmental disorders, which includes autistic disorder, Asperger syndrome, and pervasive developmental disorder not otherwise specified (PDD-NOS), is characterized by abnormalities in one or more of the following domains: language use, reciprocal social interactions, and/or a pattern of restricted interests or stereotyped behaviors. Prevalence estimates for ASDs have been increasing over the past few decades, with estimates at ~5/10,000 in the 1960s, and current estimates as (...) high as 1/88 (Newschaffer et al. 2007; CDC 2012).1 While ASDs encompass a wide range of phenotypes and degrees of severity, the disorders .. (shrink)

I explore the view that the imago Dei is essential to us as humans but accidental to us as persons. To image God is to resemble God, and resemblance comes in degrees. This has the straightforward—and perhaps disturbing—implication that we can be more or less human, and possibly cease to be human entirely. Hence, I call it the spectrum view. I argue that the spectrum view is complementary to the Biblical data, helps explain the empirical reality of horrendous (...) evil, and offers an elegant rapprochement between the traditional view of hell and its rivals. (shrink)

Slaman and Wehner have constructed structures which distinguish the computable Turing degree 0 from the noncomputable degrees, in the sense that the spectrum of each structure consists precisely of the noncomputable degrees. Downey has asked if this can be done for an ordinary type of structure such as a linear order. We show that there exists a linear order whose spectrum includes every noncomputable Δ 0 2 degree, but not 0. Since our argument requires the technique (...) of permitting below a Δ 0 2 set, we include a detailed explanation of the mechanics and intuition behind this type of permitting. (shrink)

We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turing degrees determined by b is the degree spectrum of the successor relation of some computable linear ordering. This follows from our main result, that for a large class of linear orderings the degree spectrum of the successor relation is closed upward in the c.e. Turing degrees.

We show that for every c.e. degree a > 0 there exists an intrinsically c.e. relation on the domain of a computable structure whose degree spectrum is {0, a}. This result can be extended in two directions. First we show that for every uniformly c.e. collection of sets S there exists an intrinsically c.e. relation on the domain of a computable structure whose degree spectrum is the set of degrees of elements of S. Then we (...) show that if α ∈ ω∪{ω } then for any α-c.e. degree a > 0 there exists an intrinsically α-c.e. relation on the domain of a computable structure whose degree spectrum is {0, a}. All of these results also hold for m-degree spectra of relations. (shrink)

Two objects of valuation are said to be incommensurable if neither is better than the other, nor are they equally good. This negative, coarse-grained characterization fails to capture the nuanced structure of incommensurability. We argue that our evaluative resources are far richer than orthodoxy recognizes. We model value comparisons with the corresponding class of permissible preference orderings. Then, making use of our model, we introduce a potentially infinite set of degrees of approximation to better, worse, and equally good, which we (...) interpret as degrees of commensurability.One payoff is the solution our approach provides to a paradox in population ethics, generated by Parfit's “Continuum Argument”. Parfit imagines a sequence of populations, starting with one consisting of excellent lives and, by a sequence of apparent improvements, reaching a much larger population of lives barely worth living. What he dubs “the Repugnant Conclusion” is that the final population is better than the first. Developing Parfit's response, we argue that some of the populations in the sequence are merely almost better than their immediate predecessors. Almost better is not transitive (unlike better). We offer analogies to other ‘spectrum arguments’, Condorcet's paradox, and to developments in formal epistemology. (shrink)

We show that for every computably enumerable degree a > 0 there is an intrinsically c.e. relation on the domain of a computable structure of computable dimension 2 whose degree spectrum is { 0 , a } , thus answering a question of Goncharov and Khoussainov 55–57). We also show that this theorem remains true with α -c.e. in place of c.e. for any α∈ω∪{ω} . A modification of the proof of this result similar to what was (...) done in Hirschfeldt shows that for any α∈ω∪{ω} and any α -c.e. degrees a 0 ,…, a n there is an intrinsically α -c.e. relation on the domain of a computable structure of computable dimension n+1 whose degree spectrum is { a 0 ,…, a n } . These results also hold for m-degree spectra of relations. (shrink)

Human freedom is in tension with nomological determinism and with statistical determinism. The goal of this paper is to answer both challenges. Four contributions are made to the free-will debate. First, we propose a classification of scientific theories based on how much freedom they allow. We take into account that indeterminism comes in different degrees and that both the laws and the auxiliary conditions can place constraints. A scientific worldview pulls towards one end of this classification, while libertarianism pulls towards (...) the other end of the spectrum. Second, inspired by Hoefer, we argue that an interval of auxiliary conditions corresponds to a region in phase space, and to a bundle of possible block universes. We thus make room for a form of non-nomological indeterminism. Third, we combine crucial elements from the works of Hoefer and List; we attempt to give a libertarian reading of this combination. On our proposal, throughout spacetime, there is a certain amount of freedom that can be interpreted as the result of agential choices. Fourth, we focus on the principle of alternative possibilities throughout and propose three ways of strengthening it. (shrink)

We study the weak truth table degree spectra of first-order relational structures. We prove a dichotomy among the possible wtt degree spectra along the lines of Knight’s upward-closure theorem for Turing degree spectra. We prove new results contrasting the wtt degree spectra of finite- and infinite-signature structures. We show that, as a method of defining classes of reals, the wtt degree spectrum is, except for some trivial cases, strictly more expressive than the Turing (...) class='Hi'>degree spectrum. (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 (...) class='Hi'>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 present results from a single case study based on semi-structured interviews with a student (a boy in school year 3) diagnosed with autism spectrum disorder and his school staff after participating in a short and small-scale intervention carried out in a socio-economically disadvantaged Swedish elementary school in 2019. The student participated in a seven week long intervention with a total of 12 philosophical dialogues (ranging from 45 to 60 minutes). Two facilitators, both with years of facilitation experience and (...) teacher degree and at least BA in philosophy, facilitated the majority of the dialogues and mainly followed a ”routine” procedure. The student was interviewed in direct connection to the end of the intervention about his experiences from the dialogues and his perceptions about whether and how the dialogues had influenced him. The student’s two teachers, who had participated in the dialogues as participants, were interviewed as a pair, also in direct connection to the end of the intervention, while the school principal was interviewed two years after the study. These staff interviews concerned the staff’s experiences of the influence of the dialogues on the students within the intervention as well as transfer effects to other contexts in school. The data from the study include detailed elaborations from a student perspective of different effects on the student’s communicative and cognitive development, which are in several respects supported also by staff reports. The results show that the student was able, interested, and willing to participate in philosophical dialogues, and our data point to several positive outcomes for the student in the communicative and cognitive domains. (shrink)

Several researchers have recently established that for every Turing degree \, the real closed field of all \-computable real numbers has spectrum \. We investigate the spectra of real closed fields further, focusing first on subfields of the field \ of computable real numbers, then on archimedean real closed fields more generally, and finally on non-archimedean real closed fields. For each noncomputable, computably enumerable set C, we produce a real closed C-computable subfield of \ with no computable copy. (...) Then we build an archimedean real closed field with no computable copy but with a computable enumeration of the Dedekind cuts it realizes, and a computably presentable nonarchimedean real closed field whose residue field has no computable presentation. (shrink)

What has been learned about logic by means of "uninterpreted" logistic systems can be supplemented by comparing the latter with systems which are more uninterpreted, as well as with others which are less uninterpreted than the well-known logistic systems. By somewhat extending the meaning of 'uninterpreted', I hope to establish certain claims about the nature of logistic systems and also to cast some light on the nature of "logic itself." My procedure involves looking at three major "degrees" of interpretation: first, (...) systems uninterpreted both semantically and syntactically, second, systems uninterpreted semantically but not syntactically, and third, systems uninterpreted neither semantically nor syntactically. We shall be forced to limit ourselves to the truth-functional part of logic in this brief study. What are usually called uninterpreted systems can be seen on a continuum of "degrees" of interpretation, from ordinary reasoning at one extreme to a "thoroughly uninterpreted system" at the other. "Logic itself" apparently lies nearer to the interpreted, deformalized end of the spectrum than to the uninterpreted, formalized end. Logic is not identical with any particular logistic system, but is that which the particular logistic systems aim to formalize or model or capture. I propose that it is that minimum set of logical, rather than syntactical, primitive terms, definitions, and rules which is needed to generate logically, rather than syntactically, the principles of ordinary reasoning as it is used by logicians in their metalinguistic discussions and informal proofs of metatheorems. This minimum set is somewhat larger than the primitive bases of most logistic systems; its truth-functional part is presented in the "Deformalized Logic" at degree twelve. (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)

This study investigated the understanding of underinformative sentences like “Some elephants have trunks” by children with autism spectrum disorder (ASD). The scalar term ‘some’ can be interpreted pragmatically, ‘Not all elephants have trunks’, or logically, ‘Some and possibly all elephants have trunks’. Literature indicates that adults with ASD show no real difficulty in interpreting scalar implicatures, i.e., they often interpret them pragmatically, as controls do. This contrasts with the traditional claim of difficulties of people with ASD in other pragmatic (...) domains, and is more in line with the idea that pragmatic problems are not universal. The aim of this study was to: a) gain insight in the ability of children with ASD to derive scalar implicatures, and b) do this by assessing not only sensitivity to underinformativeness, but also different degrees of tolerance to violations of informativeness. We employed a classic statement-evaluation task, presenting optimal, logical false, and underinformative utterances. In Experiment 1, children had to express their judgment on a binary option ‘I agree’ vs ‘I disagree’. In Experiment 2, a ternary middle answer option ‘I agree a bit’ was also available. Sixty-six Flemish-speaking 10-year-old children were tested: 22 children with ASD, an IQ-matched group, and an age-matched group. In the binary judgment task, the ASD-group gave more pragmatic answers than the other groups, which was significant in the mixed effects logistic regression analysis, although not in the non-parametric analysis. In the ternary judgment task, the children with ASD showed a dichotomized attitude towards the speaker’s meaning, by tending to either fully agree or fully disagree with underinformative statements, in contrast with TD children, who preferred the middle option. Remarkably, the IQ-matched group exhibited the same pattern of results as the ASD group. Thanks to a fine-grained measure such as the ternary judgment task, this study highlighted a neglected aspect of the pragmatic profile of ASD, whose struggle with social communication seems to affect also the domain of informativeness. We discuss the implications of the dichotomized reaction towards violations of informativeness of these two groups in terms of the potential role of ASD and of cognitive and verbal abilities. (shrink)

We construct a class of relations on computable structures whose degree spectra form natural classes of degrees. Given any computable ordinal and reducibility r stronger than or equal to m-reducibility, we show how to construct a structure with an intrinsically invariant relation whose degree spectrum consists of all nontrivial r-degrees. We extend this construction to show that can be replaced by either or.

Slaman and Wehner have constructed structures which distinguish the computable Turing degree 0 from the noncomputable degrees, in the sense that the spectrum of each structure consists precisely of the noncomputable degrees. Downey has asked if this can be done for an ordinary type of structure such as a linear order. We show that there exists a linear order whose spectrum includes every noncomputable $\Delta^0_2$ degree, but not 0. Since our argument requires the technique of permitting (...) below a $\Delta^0_2$ set, we include a detailed explanation of the mechanics and intuition behind this type of permitting. (shrink)

With every new recursive relation R on a recursive model , we consider the images of R under all isomorphisms from to other recursive models. We call the set of Turing degrees of these images the degree spectrum of R on , and say that R is intrinsically r.e. if all the images are r.e. C. Ash and A. Nerode introduce an extra decidability condition on , expressed in terms of R. Assuming this decidability condition, they prove that (...) R is intrinsically r.e. if and only if a natural recursive-syntactic condition is satisfied. We show that, while a recursive non-intrinsically r.e. relation may have a two element degree spectrum, a non-intrinsically r.e. relation which satisfies the Ash–Nerode decidability condition has an infinite degree spectrum. We also study several related decidability conditions and their effects on the degree spectra, including some conditions which are sufficient to obtain every r.e. degree in a spectrum. (shrink)

We introduce a hierarchy of sets which can be derived from the integers using countable collections. Such families can be coded into countable algebraic structures preserving their algorithmic properties. We prove that for different finite levels of the hierarchy the corresponding algebraic structures have different classes of possible degree spectra.

Autism Spectrum Disorder (ASD) is extremely heterogeneous clinically and genetically. There is a pressing need for a better understanding of the heterogeneity of ASD based on scientifically rigorous approaches centered on systematic evaluation of the clinical and research utility of both phenotype and genotype markers. This paper presents a holistic PheWAS-inspired method to identify meaningful associations between ASD phenotypes and genotypes. We generate two types of phenotype-phenotype (p-p) graphs: a direct graph that utilizes only phenotype data, and an indirect (...) graph that incorporates genotype as well as phenotype data. We introduce a novel methodology for fusing the direct and indirect p-p networks in which the genotype data is incorporated into the phenotype data in varying degrees. The hypothesis is that the heterogeneity of ASD can be distinguished by clustering the p-p graph. The obtained graphs are clustered using network-oriented clustering techniques, and results are evaluated. The most promising clusterings are subsequently analyzed for biological and domain-based relevance. Clusters obtained delineated different aspects of ASD, including differentiating ASD-specific symptoms, cognitive, adaptive, language and communication functions, and behavioral problems. Some of the important genes associated with the clusters have previous known associations to ASD. We found that clusters based on integrated genetic and phenotype data were more effective at identifying relevant genes than clusters constructed from phenotype information alone. These genes included five with suggestive evidence of ASD association and one known to be a strong candidate. (shrink)

Prevailing theories of the neural basis of at least a subset of individuals with autism spectrum disorder include an imbalance of excitatory and inhibitory neurotransmission. These circuitry imbalances are commonly probed in adults using auditory steady-state responses to elicit coherent electrophysiological responses from intact circuitry. Challenges to the ASSR methodology occur during development, where the optimal ASSR driving frequency may be unknown. An alternative approach is the amplitude-modulated sweep in which the amplitude of a tone is modulated as a (...) sweep from 10 to 100 Hz over the course of ∼15 s. Phase synchrony of evoked responses, measured via intra-trial coherence, is recorded as a function of frequency. We applied such AM sweep stimuli bilaterally to 40 typically developing and 80 children with ASD, aged 6–18 years. Diagnoses were confirmed by DSM-5 criteria as well as autism diagnostic observation schedule observational assessment. Stimuli were presented binaurally during MEG recording and consisted of 20 AM swept stimuli with a duration of ∼30 s each. Peak intra-trial coherence values and peak response frequencies of source modeled responses were examined. First, the phase synchrony or inter-trial coherence of the ASSR is diminished in ASD; second, hemispheric bias in the ASSR, observed in typical development, is maintained in ASD, and third, that the frequency at which the peak response is obtained varies on an individual basis, in part dependent on age, and with altered developmental trajectories in ASD vs. TD. Finally, there appears an association between auditory steady-state phase synchrony and clinical assessment of language ability/impairment. We concluded that the AM sweep stimulus provides a mechanism for probing ASSR in an unbiased fashion, during developmental maturation of peak response frequency, peak frequencies vary, in part due to developmental age, and importantly, ITC at this peak frequency is diminished in ASD, with the degree of ITC disturbance related to clinically assessed language impairment. (shrink)

This study explored the relations between the social support network of mothers of children with autism spectrum disorder, perceived social support, and their subjective wellbeing. The participants were mothers of children with ASD in Shanghai. Their social support network structure was explored via the nomination method. Perceived social support was measured using the Revised Social Provisions Scale for Autism, and the mothers’ subjective wellbeing was assessed using the Index of Wellbeing, Index of General Affect. A significant correlation was observed (...) between the subjective wellbeing of mothers of children with ASD and perceived social support. Meanwhile, perceived social support was significantly correlated with the effectiveness of overall social support. Finally, perceived social support was also significantly correlated with the network size of social support. Moreover, the effectiveness of social support was significantly associated with the network size of social support and was highly significantly associated with the degree of intimacy of social support. Furthermore, the network size of instrumental support has a significant influence on all perceived social support subdimensions. Overall, social support effectiveness plays an important role in the social support network mechanism on perceived social support and subjective wellbeing in China. (shrink)

In a 2007 paper, we argued that speakers with Autism Spectrum Disorders exhibit pragmatic abilities which are surprising given the usual understanding of communication in that group. That is, it is commonly reported that people diagnosed with an ASD have trouble with metaphor, irony, conversational implicature and other non-literal language. This is not a matter of trouble with knowledge and application of rules of grammar. The difficulties lie, rather, in successful communicative interaction. Though we did find pragmatic errors within (...) literal talk, the transcribed conversations we studied showed many, many successes. A second paper reinforced our finding of a general level of success. It considered differences within the class of pragmatically-inflected yet literal speech acts. The present paper carries our project forward. It overcomes some of the methodological limitations of the second paper, by increasing sample size, and looking at frequency of use rather than just seeming errors. It also includes a control sample. The emerging results are two-fold. On the one hand, there was a slight, statistically significant difference in frequency of use between our participants and the controls in four sub-categories: indexicals, possessives, polysemy and degree on a scale. In all four, the participants diagnosed with ASDs had fewer occurrences overall, relative to controls. On the other hand, there was no significant difference in error rates between ASDs and controls — not in any of the eight categories of pragmatic determinants of literal content that we coded for. The upshot is that, though there were less-preferred forms for participants with ASDs, they do very well indeed with pragmatic determinants of literal content. (shrink)

In a 2007 paper, we argued that speakers with Autism Spectrum Disorders exhibit pragmatic abilities which are surprising given the usual understanding of communication in that group. That is, it is commonly reported that people diagnosed with an ASD have trouble with metaphor, irony, conversational implicature and other non-literal language. This is not a matter of trouble with knowledge and application of rules of grammar. The difficulties lie, rather, in successful communicative interaction. Though we did find pragmatic errors within (...) literal talk, the transcribed conversations we studied showed many, many successes. A second paper reinforced our finding of a general level of success. It considered differences within the class of pragmatically-inflected yet literal speech acts. The present paper carries our project forward. It overcomes some of the methodological limitations of the second paper, by increasing sample size, and looking at frequency of use rather than just seeming errors. It also includes a control sample. The emerging results are two-fold. On the one hand, there was a slight, statistically significant difference in frequency of use between our participants and the controls in four sub-categories: indexicals, possessives, polysemy and degree on a scale. In all four, the participants diagnosed with ASDs had fewer occurrences overall, relative to controls. On the other hand, there was no significant difference in error rates between ASDs and controls — not in any of the eight categories of pragmatic determinants of literal content that we coded for. The upshot is that, though there were less-preferred forms for participants with ASDs, they do very well indeed with pragmatic determinants of literal content. (shrink)

Objectives: Autism spectrum disorder (ASD) is a juvenile onset neurodevelopmental disorder with social impairment and stereotyped behavior as the main symptoms. Unaffected relatives may also exhibit similar ASD features due to genetic factors. Although previous studies have demonstrated atypical brain morphological features as well as task-state brain function abnormalities in unaffected parents with ASD children, it remains unclear the pattern of brain function in the resting state.Methods: A total of 42 unaffected parents of ASD children (pASD) and 39 age-, (...) sex-, and handedness-matched controls were enrolled. Multiple resting-state fMRI (rsfMRI) analyzing methods were applied, including amplitude of low-frequency fluctuation (ALFF), regional homogeneity (ReHo), degree centrality (DC), and functional connectivity (FC), to reveal the functional abnormalities of unaffected parents in ASD-related brain regions. Spearman Rho correlation analysis between imaging metric values and the severity of ASD traits were evaluated as well.Results: ALFF, ReHo, and DC methods all revealed abnormal brain regions in the pASD group, such as the left medial orbitofrontal cortex (mOFC) and rectal gyrus (ROI-1), bilateral supplementary motor area (ROI-2), right caudate nucleus head and right amygdala/para-hippocampal gyrus (ROI-3). FC decreasing was observed between ROI-1 and right anterior cingulate cortex (ACC), ROI-2, and bilateral precuneus. FC enhancing was observed between ROI-3 and right anterior cerebellar lobe, left medial temporal gyrus, left superior temporal gyrus, left medial frontal gyrus, left precentral gyrus, right postcentral gyrus in pASD. In addition, ALFF values in ROI-1, DC values in ROI-3 were positively correlated with AQ scores in pASD (ρ1 = 0.298, P1 = 0.007; ρ2 = 0.220, P2 = 0.040), while FC values between ROI-1 and right ACC were negatively correlated with AQ scores (ρ3 = −0.334, P3 = 0.002).Conclusion: rsfMRI metrics could be used as biomarkers to reveal the underlying neurobiological feature of ASD for unaffected parents. (shrink)

Impairments in emotional face processing are demonstrated by individuals with neurodevelopmental disorders, including autism spectrum disorder and attention-deficit/hyperactivity disorder, which is associated with altered emotion processing networks. Despite accumulating evidence of high rates of diagnostic overlap and shared symptoms between ASD and ADHD, functional connectivity underpinning emotion processing across these two neurodevelopmental disorders, compared to typical developing peers, has rarely been examined. The current study used magnetoencephalography to investigate whole-brain functional connectivity during the presentation of happy and angry faces (...) in 258 children, including ASD, ADHD and typically developing groups to determine possible differences in emotion processing. Data-driven clustering was also applied to determine whether the patterns of connectivity differed among diagnostic groups. We found reduced functional connectivity in the beta band in ASD compared to TD, and a further reduction in the ADHD group compared to the ASD and the TD groups, across emotions. A group-by-emotion interaction in the gamma frequency band was also observed. Greater connectivity to happy compared to angry faces was found in the ADHD and TD groups, while the opposite pattern was seen in ASD. Data-driven subgrouping identified two distinct subgroups: NDD-dominant and TD-dominant; these subgroups demonstrated emotion- and frequency-specific differences in connectivity. Atypicalities in specific brain networks were strongly correlated with the severity of diagnosis-specific symptoms. Functional connectivity strength in the beta network was negatively correlated with difficulties in attention; in the gamma network, functional connectivity strength to happy faces was positively correlated with adaptive behavioural functioning, but in contrast, negatively correlated to angry faces. Our findings establish atypical frequency- and emotion-specific patterns of functional connectivity between NDD and TD children. Data-driven clustering further highlights a high degree of comorbidity and symptom overlap between the ASD and ADHD children. (shrink)

Disorders of agency could be described as cases where people encounter difficulties in assessing their own degree of responsibility or involvement with respect to a relevant action or event. These disturbances in one’s sense of agency appear to be meaningfully connected with some mental disorders and with some symptoms in particular—i.e. auditory verbal hallucinations, thought insertion, pathological guilt. A deeper understanding of these experiences may thus contribute to better identification and possibly treatment of people affected by such disorders. In (...) this paper I explore disorders of agency to flesh out their phenomenology in more detail as well as to introduce some theoretical distinctions between them. Specifically, I argue that we may better understand disorders of agency by characterizing them as dimensional. In §1 I explore the cases of Auditory Verbal Hallucinations (AVH) and pathological guilt and I show that they lie at opposite ends of the agency spectrum (i.e. hypoagency versus hyperagency). In §2 I focus on two intermediate cases of hypo- and hyper- agency. These are situations that, despite being very similar to pathological ones, may be successfully distinguished from them in virtue of quantitative factors (e.g. duration, frequency, intensity). I first explore the phenomenon of mind wandering as an example of hypoagency, and I then discuss the phenomenon of false confessions as an example of hyperagency. While cases of hypoagency exemplify situations where people experience their own thoughts, bodies, or actions as something beyond their control, experiences of hyperagency provide an illusory sense of control over actions or events. (shrink)

High-functioning individuals with autism spectrum disorder typically lack cognitive empathy, compromising their moral agency from both a Kantian and a Humean perspective. Nevertheless, they are capable of exhibiting moral behavior, and sometimes, they exhibit what may be deemed ‘super-moral’ behavior. The empathy deficit poses, to varying degrees, limitations with respect to their moral motivation and moral agency. To compensate for this deficit, individuals with HF-ASD rely primarily, and justifiably, on the formation and application of moral rules. Educators who focus (...) predominantly on empathy, however, may be less effective in the moral education of individuals with HF-ASD because they neglect the preference for rules of the latter. In this article, I argue that an individualized balance of empathy-based and rule-based strategies in the context of moral education is needed to assist individuals with HF-ASD in their challenges with moral motivation and moral agency. (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)

The contingentist/inevitabilist debate contests whether the results of successful science are contingent or inevitable. This article addresses lingering ambiguity in the way contingency is defined in this debate. I argue that contingency in science can be understood as a collection of distinct concepts, distinguished by how they hold science contingent, by what elements of science they hold contingent, and by what those elements are contingent upon. I present a preliminary taxonomy designed to characterize the full-range positions available and illustrate that (...) these constitute a diverse array rather than a spectrum. (shrink)

The contingentist/inevitabilist debate contests whether the results of successful science are contingent or inevitable. This article addresses lingering ambiguity in the way contingency is defined in this debate. I argue that contingency in science can be understood as a collection of distinct concepts, distinguished by how they hold science contingent, by what elements of science they hold contingent, and by what those elements are contingent upon. I present a preliminary taxonomy designed to characterize the full-range positions available and illustrate that (...) these constitute a diverse array rather than a spectrum. (shrink)

Historia, as both a type of critical inquiry and a source of information about nature and the human world, is a key category in Spinoza’s Tractatus theologico-politicus. In this work, the Latin word cannot be simply and invariably translated as “history,” not even if we add the proviso that its meaning wavers inevitably between “history” and “story,” for its semantic range is too broad and complex. At the two ends of the semantic spectrum we have the impartial report, on (...) the one hand, and the creations of sheer fantasy, on the other. Historia may therefore denote the detached observation of nature and the philological analysis of a text, but it can also refer to the free exercise of the imagination in a variety of narrative contexts. While Spinoza denies that the inquiry resulting from historia and its products may have true cognitive value, he acknowledges that historia plays a fundamental role in society and politics. The reason is that historia and the imagination are bound up together by a special relationship. This is apparent at all levels of the historical engagement with reality, but is particularly true in the case of religion, moral norms and belief systems, for in this variegated domain the link between imagination and historia functions as the connective tissue that keeps societies united and functioning. This specific nexus of imagination and historia is Spinoza’s original contribution to the early modern notion of “moral certainty.” More importantly, it is only at this level that Spinoza grants a modicum of intelligibility to the ‘historical’ productions of the imagination, be they signa, revelationes, or even nugae. The fact remains, though, that to a certain extent humans keep having a distorted grasp of reality, indeed hallucinate, even when their ‘historical’ accounts of reality are socially and politically productive. Here the key element is the notion of fictional continuity based on a socially constructed trust in narrative accounts of reality: the imagination turns reality into stories, but in so doing it keeps the otherwise constitutively hallucinatory nature of humans at bay and under control. Perceptibilitas, that is, the ability to provide acceptable cognitive solutions between intelligible knowledge and moral certainty, is ultimately what defines the contribution of the imagination to the human work of knowledge. (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.

The paper studies Heyting algebras within the framework of computable structure theory. We prove that the class _K_ containing all Heyting algebras with distinguished atoms and coatoms is complete in the sense of the work of Hirschfeldt et al. (Ann Pure Appl Logic 115(1-3):71-113, 2002). This shows that the class _K_ is rich from the computability-theoretic point of view: for example, every possible degree spectrum can be realized by a countable structure from _K_. In addition, there is no (...) simple syntactic characterization of computably categorical members of _K_ (i.e., structures from _K_ possessing a unique computable copy, up to computable isomorphisms). (shrink)

We prove that there is a structure, indeed a linear ordering, whose degree spectrum is the set of all non-hyperarithmetic degrees. We also show that degree spectra can distinguish measure from category.

We consider embeddings of structures which preserve spectra: if g: M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (as a relation on S). We show that the computable dense linear order L is universal for all countable linear orders under this notion of embedding, and we establish a similar result for the computable random graph G. Such structures are said to be spectrally universal. We use (...) our results to answer a question of Goncharov, and also to characterize the possible spectra of structures as precisely the spectra of unary relations on G. Finally, we consider the extent to which all spectra of unary relations on the structure L may be realized by such embeddings, offering partial results and building the first known example of a structure whose spectrum contains precisely those degrees c with c′ ≥T 0″. (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.

It is proved that for every countable structure and a computable successor ordinal α there is a countable structure which is ‐least among all countable structures such that is Σ‐definable in the αth jump. We also show that this result does not hold for the limit ordinal. Moreover, we prove that there is no countable structure with the degree spectrum for.

Results of R. Miller in 2009 proved several theorems about algebraic fields and computable categoricity. Also in 2009, A. Frolov, I. Kalimullin, and R. Miller proved some results about the degree spectrum of an algebraic field when viewed as a subfield of its algebraic closure. Here, we show that the same computable categoricity results also hold for finite-branching trees under the predecessor function and for connected, finite-valence, pointed graphs, and we show that the degree spectrum results (...) do not hold for these trees and graphs. We also offer an explanation for why the degree spectrum results distinguish these classes of structures: although all three structures are algebraic structures, the fields are what we call effectively algebraic. (shrink)

We extend the limitwise monotonicity notion to the case of arbitrary computable linear ordering to get a set which is limitwise monotonic precisely in the non‐computable degrees. Also we get a series of connected non‐uniformity results to obtain new examples of non‐uniformly equivalent families of computable sets with the same enumeration degree spectrum.

The power to exercise control is a crucial feature of agency. Necessarily, if S cannot exercise some degree of control over anything - any state of affairs, event, process, object, or whatever - S is not an agent. If S is not an agent, S cannot act intentionally, responsibly, or rationally, nor can S possess or exercise free will. In my dissertation I reflect on the nature of control, and on the roles consciousness plays in its exercise. I first (...) consider the fragmented state of philosophical and empirical work on control. I argue that a mature philosophy of agency stands in need of a detailed personal-level account of control, and I begin by explicating a notion I call intentional control. On this explication, an agent J exercises intentional control in service of an intention X to the degree that behavior of J's for which X plays a (non-deviant) causal role approximates the representational content of X. With this explication in hand, I offer analyses of theoretically salient points along a degreed spectrum (covering, e.g., the exercise of minimal, successful, and perfect intentional control). Next, I develop an account of the degrees of intentional control's possession. This involves elucidation of ingredients of intentional control, i.e. those features of agents and environments that constitute an agent's causal potency and skill. It turns out that an agent's possession of control regarding an intention is intimately tied to her ability to repeatedly execute that intention across some specified (hypothetical) set of scenarios. Finally, I discuss a number of potentially fruitful applications of the account. In chapter three I confront a strong intuition, persistent in both philosophy and cognitive science, that consciousness is somehow intimately involved in the exercise of control. In this connection recent empirical work indicates the causal powers of consciousness remain poorly understood. I argue that Functional Agnosticism - the view that any claim regarding a function of consciousness for behavior is currently underdetermined by the data - is the wisest position on the causal powers of consciousness. Recognition of this unsatisfying state of affairs motivates reflection on what might enable progress beyond it. I argue that establishing a causal function for consciousness is facilitated by clarity on several issues. First, what is the sense of consciousness at issue? I isolate state consciousness, discuss the potential relevance of various types of conscious states, and distinguish between ambitious and modest approaches to the causal powers of state consciousness. In short, ambitious approaches seek to understand the causal contributions of a conscious mental state in virtue of the fact that the state is conscious; modest approaches seek to understand the causal contributions of conscious mental states, full stop. I argue that for various theoretical purposes, both approaches can be useful. Second, what is the sense of control at issue? I argue that for many important theoretical purposes, intentional control is the relevant sense. Finally, I illustrate the usefulness of clarity on these issues by examining recent work on the roles of conscious and unconscious vision for action. This work suggests that some important subset of our overt action is controlled by non-conscious processes. I apply insights developed earlier, noting common mistakes made in this literature, and highlighting important empirical possibilities these mistakes obscure. In later chapters I develop a novel account of conscious control. In chapter four I develop a central part of the account, which involves a view on the intentional structure of conscious trying. The leading view entails that conscious trying possesses a descriptive (or thetic) structure. Based on relevant empirical work concerning deafferented and paralyzed patients, I argue for the view that conscious trying is (at least) partially constituted by directive (or telic) structure. Finally, I argue that the exercise of conscious control is best understood as an exercise of intentional control for which the experience of trying plays a constitutive role. After presenting arguments for this view and defending the view against objections, I discuss the importance of conscious control for a mature philosophy of mind and agency. (shrink)

We prove two antibasis theorems for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Pi^0_1}$$\end{document} classes. The first is a jump inversion theorem for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Pi^0_1}$$\end{document} classes with respect to the global structure of the Turing degrees. For any \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${P\subseteq 2^\omega}$$\end{document}, define S(P), the degree spectrum of P, to be the set of all Turing degrees a such that there exists (...) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${A \in P}$$\end{document} of degree a. For any degree \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\bf a \geq 0'}}$$\end{document}, let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textrm{Jump}^{-1}({\bf a) = \{b : b' = a \}}}$$\end{document}. We prove that, for any \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\bf a \geq 0'}}$$\end{document} and any \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Pi^0_1}$$\end{document} class P, if \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textrm{Jump}^{-1} ({\bf a}) \subseteq S(P)}$$\end{document} then P contains a member of every degree. For any degree \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\bf a \geq 0'}}$$\end{document} such that a is recursively enumerable (r.e.) in 0', let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${Jump_{\bf \leq 0'} ^{-1}({\bf a)=\{b : b \leq 0' \textrm{and} b' = a \}}}$$\end{document}. The second theorem concerns the degrees below 0'. We prove that for any \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\bf a\geq 0'}}$$\end{document} which is recursively enumerable in 0' and any \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Pi^0_1}$$\end{document} class P, if \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textrm{Jump}_{\bf \leq 0'} ^{-1}({\bf a)} \subseteq S(P)}$$\end{document} then P contains a member of every degree. (shrink)

David Lewis—famously—never tasted vegemite. Did he have any knowledge of what it's like to taste vegemite? Most say 'no'; I say 'yes'. I argue that knowledge of what it’s like varies along a spectrum from more exact to more approximate, and that phenomenal concepts vary along a spectrum in how precisely they characterize what it’s like to undergo their target experiences. This degreed picture contrasts with the standard all-or-nothing picture, where phenomenal concepts and phenomenal knowledge lack any such (...) degreed structure. I motivate the degreed picture by appeal to (1) limits in epistemic abilities such as recognition, imagination, and inference, and (2) the semantics of ‘knows what it’s like’ expressions. I argue that approximate phenomenal knowledge cannot be explained merely via determinable or vague phenomenal concepts. I develop a framework for systematizing approximate knowledge of phenomenal character. And I explain how my view challenges some standard assumptions about the acquisition conditions, requirements for mastery, and referential mechanisms of phenomenal concepts. (shrink)