The first main result isolates some conditions which fail for the class of graphs and hold for the class of Abelian p-groups, the class of Abelian torsion groups, and the special class of "rank-homogeneous" trees. We consider these conditions as a possible definition of what it means for a class of structures to have "Ulm type". The result says that there can be no Turing computable embedding of a class not of Ulm type into one of Ulm type. We apply (...) this result to show that there is no Turing computable embedding of the class of graphs into the class of "rank-homogeneous" trees. The second main result says that there is a Turing computable embedding of the class of rank-homogeneous trees into the class of torsion-free Abelian groups. The third main result says that there is a "rank-preserving" Turing computable embedding of the class of rank-homogeneous trees into the class of Boolean algebras. Using this result, we show that there is a computable Boolean algebra of Scott rank ${\mathrm{\omega }}_{1}^{\mathrm{C}\mathrm{K}}$. (shrink)

This paper calculates, in a precise way, the complexity of the index sets for three classes of computable structures: the class $K_{\omega _{1}^{\mathit{CK}}}$ of structures of Scott rank $\omega _{1}^{\mathit{CK}}$ , the class $K_{\omega _{1}^{\mathit{CK}}+1}$ of structures of Scott rank $\omega _{1}^{\mathit{CK}}+1$ , and the class K of all structures of non-computable Scott rank. We show that I(K) is m-complete $\Sigma _{1}^{1},\,I(K_{\omega _{1}^{\mathit{CK}}})$ is m-complete $\Pi _{2}^{0}$ relative to Kleen's O, and $I(K_{\omega _{1}^{\mathit{CK}}+1})$ is m-complete $\Sigma _{2}^{0}$ relative to O.

LetEbe a computably enumerable equivalence relation on the setωof natural numbers. We say that the quotient set$\omega /E$realizesa linearly ordered set${\cal L}$if there exists a c.e. relation ⊴ respectingEsuch that the induced structure is isomorphic to${\cal L}$. Thus, one can consider the class of all linearly ordered sets that are realized by$\omega /E$; formally,${\cal K}\left = \left\{ {{\cal L}\,|\,{\rm{the}}\,{\rm{order}}\, - \,{\rm{type}}\,{\cal L}\,{\rm{is}}\,{\rm{realized}}\,{\rm{by}}\,E} \right\}$. In this paper we study the relationship between computability-theoretic properties ofEand algebraic properties of linearly ordered sets realized (...) byE. One can also define the following pre-order$ \le _{lo} $on the class of all c.e. equivalence relations:$E_1 \le _{lo} E_2 $if every linear order realized byE1is also realized byE2. Following the tradition of computability theory, thelo-degrees are the classes of equivalence relations induced by the pre-order$ \le _{lo} $. We study the partially ordered set oflo-degrees. For instance, we construct various chains and anti-chains and show the existence of a maximal element among thelo-degrees. (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 (ω).

We study the structure of Σ11 equivalence relations on hyperarithmetical subsets of ω under reducibilities given by hyperarithmetical or computable functions, called h-reducibility and FF-reducibility, respectively. We show that the structure is rich even when one fixes the number of properly equation imagei.e., Σ11 but not equation image equivalence classes. We also show the existence of incomparable Σ11 equivalence relations that are complete as subsets of ω × ω with respect to the corresponding reducibility on sets. We study complete Σ11 (...) equivalence relations and show that existence of infinitely many properly Σ11 equivalence classes that are complete as Σ11 sets is necessary but not sufficient for a relation to be complete in the context of Σ11 equivalence relations. (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 complexity of the isomorphism relation on classes of computable structures. We use the notion of FF-reducibility introduced in [9] to show completeness of the isomorphism relation on many familiar classes in the context of all ${\mathrm{\Sigma }}_{1}^{1}$ equivalence relations on hyperarithmetical subsets of ω.

The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver [20] and Harrington, Kechris and Louveau [6] show that with respect to Borel reducibility, any Borel equivalence relation strictly above equality on ω is above equality on , the power set of ω, and any Borel equivalence relation strictly above equality on the reals is above equality modulo finite on . In this article we examine the effective (...) content of these and related results by studying effectively Borel equivalence relations under effectively Borel reducibility. The resulting structure is complex, even for equivalence relations with finitely many equivalence classes. However use of Kleene’s O as a parameter is sufficient to restore the picture from the noneffective setting. A key lemma is that of the existence of two effectively Borel sets of reals, neither of which contains the range of the other under any effectively Borel function; the proof of this result applies Barwise compactness to a deep theorem of Harrington establishing for any recursive ordinal α the existence of singletons whose α-jumps are Turing incomparable. (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.

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)

We show that for every computable limit ordinal α, there is a computable structure A that is $\Delta _\alpha ^0 $ categorical, but not relatively $\Delta _\alpha ^0 $ categorical (equivalently. it does not have a formally $\Sigma _\alpha ^0 $ Scott family). We also show that for every computable limit ordinal a, there is a computable structure A with an additional relation R that is intrinsically $\Sigma _\alpha ^0 $ on A. but not relatively intrinsically $\Sigma _\alpha ^0 $ (...) on A (equivalently, it is not definable by a computable $\Sigma _\alpha $ formula with finitely many parameters). Earlier results in [7], [10], and [8] establish the same facts for computable successor ordinals α. (shrink)

For a class K of structures, closed under isomorphism, the index set is the set I of all indices for computable members of K in a universal computable numbering of all computable structures for a fixed computable language. We study the complexity of the index set of class of structures with decidable theories. We first prove the result for the class of all structures in an arbitrary finite nontrivial language. After the complexity is found, we prove similar results for some (...) well-known classes of structures, such as directed graphs, undirected graphs, partial orders and lattices. (shrink)

There is a long tradition in philosophy and literary theory defending the view that engagement with literature promotes readers’ empathy. Until the last century, few of the empirical claims adduced in that tradition were investigated experimentally. Recent work in psychology and neuropsychology has now shed new light on the interplay of empathy and literature. This article surveys the experimental findings, addressing three central questions: What is it to read empathically? Does reading make us more empathic? What characteristics of literature, if (...) any, affect readers’ empathy? While experimental studies have delivered no conclusive answers to these questions, it has exposed their psychological complexity and constructed a more nuanced picture of the diverse ways in which literature interacts with our empathic capacities. (shrink)

There are two classic principles for deciding who should have a right to vote on the laws, the All Affected Principle and the All Subjected Principle. This article is devoted, firstly, to providing a sympathetic reconstruction of the All Subjected Principle, identifying the most credible account of what it is to be subject to the law. Secondly, it shows that that best account still suffers some serious difficulties, which might best be resolved by treating the All Subjected Principle as a (...) subset of the All Affected Principle with which the All Subjected Principle must in any case be supplemented. (shrink)

We study degree spectra of structures with respect to the bi-embeddability relation. The bi-embeddability spectrum of a structure is the family of Turing degrees of its bi-embeddable copies. To facilitate our study we introduce the notions of bi-embeddable triviality and basis of a spectrum. Using bi-embeddable triviality we show that several known families of degrees are bi-embeddability spectra of structures. We then characterize the bi-embeddability spectra of linear orderings and study bases of bi-embeddability spectra of strongly locally finite graphs.

Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and bi-reducibility. These spectra provide a natural way of measuring the complexity of reductions between equivalence relations. We prove that any upward closed collection of Turing degrees with a countable basis can be realised as a reducibility spectrum or as a bi-reducibility spectrum. We show also that there is a reducibility (...) spectrum of computably enumerable equivalence relations with no countable basis and a reducibility spectrum of computably enumerable equivalence relations which is downward dense, thus has no basis. (shrink)

1. Two Approaches to the EarthIn several postwar texts, the earth increasingly receives attention from Carl Schmitt.1 In The Nomos of the Earth, the most important of these texts, he refers to Friedrich Hölderlin, a much earlier, very different author, who also considers the subject of the earth. Even though the positions of both are, ultimately, quite similar, they maintain significant terminological differences. Schmitt and Hölderlin both employ the word “nomos,” but in very different ways. Hölderlin regards “nomos” as “law” (...) in the sense of “positive” norm or “Gesez.”2 This use of “nomos” as “Gesez” differs from a second notion of law as the meaning operating at the basis of what Hölderlin calls the “sphere.” The sphere is a meaningful whole in which man originally exists. Law is here the very relations of the sphere as a meaningful whole. Hölderlin calls it the law in a “negative” sense.3 This second notion of law by Hölderlin (negative law or law as the meaning at the basis of the sphere) coincides precisely with the Schmittian idea of “nomos” as an “order of meaning [Sinnreich],”4 what he also calls the law in an “ontonomous and existential” sense.5 The first use of law as “nomos” or “Gesez” by Hölderlin coincides with Schmitt’s use of “Gesetz”: of law as “positive” law. (shrink)

In the past decade, the notion of a neural correlate of consciousness has become a focal point for scientific research on consciousness. A growing number of investigators believe that the first step toward a science of consciousness is to discover the neural correlates of consciousness. Indeed, Francis Crick has gone so far as to proclaim that ‘we need to discover the neural correlates of consciousness. For this task the primate visual system seems especially attractive. No longer need one spend time (...) attempting to endure the tedium of philosophers perpetually disagreeing with each other. Consciousness is now largely a scientific problem’. Yet the question of what it means to be a neural correlate of consciousness is actually far from straightforward, for it involves fundamental empirical, methodological, and philosophical issues about the nature of consciousness and its relationship to the brain. Even if one assumes, as we do, that states of consciousness causally depend on states of the brain, one can nevertheless wonder in what sense there is, or could be, such a thing as a neural correlate of consciousness. (shrink)

Durkheim écrit ce livre avec un but double : d'abord il voulait expliquer ce qui crée une société, ce qui la tient ensemble ; ensuite il voulait éclaircir l'influence qu'a la société sur la pensée logique. Pour Durkheim, la religion est la clé utilisée pour déverrouiller ces deux problématiques.Dans ce livre, Durkheim argumente que les représentations religieuses sont en fait des représentations collectives : l'essence du religieux ne peut être que le sacré. Il est une caractéristique qui se trouve universellement (...) dans toutes les religions. Le sacré, être collectif et impersonnel, représente ainsi la société elle-même. Ensuite il argumente que la société a un impact majeur dans la genèse de la pensée logique. C'est la société qui fournit à l'individu les catégories (le temps, l'espace, le nombre etc.) et les concepts nécessaires pour la pensée logique. (shrink)

When we perceive an object, we perceive the object from a perspective. As a consequence of the perspectival nature of perception, when we perceive, say, a circular coin from different angles, there is a respect in which the coin looks circular throughout, but also a respect in which the coin's appearance changes. More generally, perception of shape and size properties has both a constant aspect—an aspect that remains stable across changes in perspective—and a perspectival aspect—an aspect that changes depending on (...) one's perspective on the object. How should we account for the perspectival aspect of spatial perception? We present a framework within which to discuss the perspectival aspect of perception and put forward three desiderata that any account of the perspectival aspect of perception should satisfy. We discuss views on which the perspectival aspect of perception is analyzed in terms of constitutively mind-dependent appearance properties as well as views on which the perspectival aspect of perception is analyzed in terms of representations of mind-independent perspectival properties. (shrink)

With special emphasis on Foucault's many recently published lecture series this book provides an updated, comprehensive presentation of his most important diagnoses, his many ground-breaking analytical concepts as well as a systematic account of his unique conception of philosophy.

We study the algorithmic complexity of isomorphic embeddings between computable structures.

Research on ethical norms has grown in recent years, but imprecise language has made it unclear when these norms prescribe “what ought to be” and when they merely describe behaviors or perceptions (“what is”). Studies of ethical norms, moreover, tend not to investigate whether participants were influenced by the prescriptive aspect of the norm; the studies primarily demonstrate, rather, that people will mimic the behaviors or perceptions of others, which provides evidence for the already well-substantiated social proof theory. In this (...) review article, we delineate three streams of norms research in business ethics: behavioral, perceptual, and prescriptive. We argue that by properly categorizing norms, and designing studies to investigate when prescriptions, more than mere mimicry, improve ethical outcomes in organizations, researchers can enhance managers’ efforts to promote ethical outcomes in organizations. (shrink)

We argue that the trend toward providing users with feasible and actionable explanations of AI decisions—known as recourse explanations—comes with ethical downsides. Specifically, we argue that recourse explanations face several conceptual pitfalls and can lead to problematic explanation hacking, which undermines their ethical status. As an alternative, we advocate that explanations of AI decisions should aim at understanding.

We combine computable structure theory and algorithmic learning theory to study learning of families of algebraic structures. Our main result is a model-theoretic characterization of the learning type InfEx_\iso, consisting of the structures whose isomorphism types can be learned in the limit. We show that a family of structures is InfEx_\iso-learnable if and only if the structures can be distinguished in terms of their \Sigma^2_inf-theories. We apply this characterization to familiar cases and we show the following: there is an infinite (...) learnable family of distributive lattices; no pair of Boolean algebras is learnable; no infinite family of linear orders is learnable. (shrink)

The Anthropocene is heralded as a new epoch distinguishing itself from all foregoing eons in the history of the Earth. It is characterized by the overarching importance of the human species in a number of respects, but also by the recognition of human dependence and precariousness. A critical human turn affecting the human condition is still in the process of arriving in the wake of an initial Copernican Revolution and Kant's ensuing second Copernican Counter-revolution. Within this landscape, issues concerning the (...) human - its finitude, responsiveness, responsibility, maturity, auto-affection and relationship to itself - appear rephrased and re-accentuated as decisive probing questions. In this book Sverre Raffnsøe explores how the change has ramifications for the kinds of knowledge that can be acquired concerning human beings and for the human sciences as a study of human existential beings in the world. (shrink)

Neste livro Gombrich discute as idéias e as posturas específicas que tiveram influência decisiva na prática da arte renascentista. Todos os estudos aqui reunidos tratam de algo a que se pode chamar clima renascentista de opiniões sobre a arte, além da influência desse clima sobre a prática e a crítica da arte.