This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean algebras, Abelian p-groups, models of arithmetic). There are many interesting results already, but there are also many natural questions still to be answered. The book is self-contained in that it includes necessary background material from recursion theory (ordinal notations, (...) the hyperarithmetical hierarchy) and model theory (infinitary formulas, consistency properties). (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.

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 mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if for all Y ∈ Q there exists X ∈ P such that X is Turing reducible to Y. A weak degree is an equivalence class of mass problems under mutual weak reducibility. Let [Formula: see text] be the lattice of weak degrees of mass problems associated with nonempty [Formula: see text] subsets of the Cantor (...) space. The lattice [Formula: see text] has been studied in previous publications. The purpose of this paper is to show that [Formula: see text] partakes of hyperarithmeticity. We exhibit a family of specific, natural degrees in [Formula: see text] which are indexed by the ordinal numbers less than [Formula: see text] and which correspond to the hyperarithmetical hierarchy. Namely, for each [Formula: see text], let hα be the weak degree of 0, the αth Turing jump of 0. If p is the weak degree of any mass problem P, let p* be the weak degree of the mass problem P* = {Y | ∃X ⊆ BLR )} where BLR is the set of functions which are boundedly limit recursive in X. Let 1 be the top degree in [Formula: see text]. We prove that all of the weak degrees [Formula: see text], [Formula: see text], are distinct and belong to [Formula: see text]. In addition, we prove that certain index sets associated with [Formula: see text] are [Formula: see text] complete. (shrink)

Theorems of hyperarithmetic analysis occupy an unusual neighborhood in the realms of reverse mathematics and recursion-theoretic complexity. They lie above all the fixed iterations of the Turing jump but below ATR $_{0}$. There is a long history of proof-theoretic principles which are THAs. Until the papers reported on in this communication, there was only one mathematical example. Barnes, Goh, and Shore [1] analyze an array of ubiquity theorems in graph theory descended from Halin’s [9] work on rays in graphs. They (...) seem to be typical applications of ACA $_{0}$ but are actually THAs. These results answer Question 30 of Montalbán’s Open Questions in Reverse Mathematics [19] and supply several other natural principles of different and unusual levels of complexity.This work led in [25] to a new neighborhood of the reverse mathematical zoo: almost theorems of hyperarithmetic analysis. When combined with ACA $_{0}$ they are THAs but on their own are very weak. Denizens both mathematical and logical are provided. Generalizations of several conservativity classes are defined and these ATHAs as well as many other principles are shown to be conservative over RCA $_{0}$ in all these senses and weak in other recursion-theoretic ways as well. These results answer a question raised by Hirschfeldt and reported in [19] by providing a long list of pairs of principles one of which is very weak over RCA $_{0}$ but over ACA $_{0}$ is equivalent to the other which may be strong or very strong going up a standard hierarchy and at the end being stronger than full second-order arithmetic. (shrink)

Theorems of hyperarithmetic analysis (THAs) occupy an unusual neighborhood in the realms of reverse mathematics and recursion theoretic complexity. They lie above all the fixed (recursive) iterations of the Turing Jump but below ATR $_{0}$ (and so $\Pi _{1}^{1}$ -CA $_{0}$ or the hyperjump). There is a long history of proof theoretic principles which are THAs. Until Barnes, Goh, and Shore [ta] revealed an array of theorems in graph theory living in this neighborhood, there was only one mathematical denizen. In (...) this paper we introduce a new neighborhood of theorems which are almost theorems of hyperarithmetic analysis (ATHAs). When combined with ACA $_{0}$ they are THAs but on their own they are very weak. We generalize several conservativity classes ( $\Pi _{1}^{1}$, r- $\Pi _{2}^{1}$, and Tanaka) and show that all our examples (and many others) are conservative over RCA $_{0}$ in all these senses and weak in other recursion theoretic ways as well. We provide denizens, both mathematical and logical. These results answer a question raised by Hirschfeldt and reported in Montalbán [2011] by providing a long list of pairs of principles one of which is very weak over RCA $_{0}$ but over ACA $_{0}$ is equivalent to the other which may be strong (THA) or very strong going up a standard hierarchy and at the end being stronger than full second order arithmetic. (shrink)

We extend the hierarchy defined in [5] to cover all hyperarithmetical reals. An intuitive idea is used or the definition, but a characterization of the related classes is obtained. A hierarchy theorem and two fixed point theorems are presented.

Where AR is the set of arithmetic Turing degrees, 0 (ω ) is the least member of { $\mathbf{\alpha}^{(2)}|\mathbf{a}$ is an upper bound on AR}. This situation is quite different if we examine HYP, the set of hyperarithmetic degrees. We shall prove (Corollary 1) that there is an a, an upper bound on HYP, whose hyperjump is the degree of Kleene's O. This paper generalizes this example, using an iteration of the jump operation into the transfinite which is based on (...) results of Jensen and is detailed in [3] and [4]. In $\S1$ we review the basic definitions from [3] which are needed to state the general results. (shrink)

In this paper, we give an example of a complete computable infinitary theory T with countable models ${\mathcal{M}}$ and ${\mathcal{N}}$ , where ${\mathcal{N}}$ is a proper computable infinitary extension of ${\mathcal{M}}$ and T has no uncountable model. In fact, ${\mathcal{M}}$ and ${\mathcal{N}}$ are (up to isomorphism) the only models of T. Moreover, for all computable ordinals α, the computable ${\Sigma_\alpha}$ part of T is hyperarithmetical. It follows from a theorem of Gregory (JSL 38:460–470, 1972; Not Am Math Soc 17:967–968, (...) 1970) that if T is a Π 1 1 set of computable infinitary sentences and T has a pair of models ${\mathcal{M}}$ and ${\mathcal{N}}$ , where ${\mathcal{N}}$ is a proper computable infinitary extension of ${\mathcal{M}}$ , then T would have an uncountable model. (shrink)

The Friedman–Stanley jump, extensively studied by descriptive set theorists, is a fundamental tool for gauging the complexity of Borel isomorphism relations. This paper focuses on a natural computable analog of this jump operator for equivalence relations on $\omega $, written ${\dotplus }$, recently introduced by Clemens, Coskey, and Krakoff. We offer a thorough analysis of the computable Friedman–Stanley jump and its connections with the hierarchy of countable equivalence relations under the computable reducibility $\leq _c$. In particular, we show that (...) this jump gives benchmark equivalence relations going up the hyperarithmetic hierarchy and we unveil the complicated highness hierarchy that arises from ${\dotplus }$. (shrink)

Computability theory is the mathematical theory of algorithms, which explores the power and limitations of computation. Classical computability theory formalized the intuitive notion of an algorithm and provided a theoretical basis for digital computers. It also demonstrated the limitations of algorithms and showed that most sets of natural numbers and the problems they encode are not decidable (Turing computable). Important results of modern computability theory include the classification of the computational difficulty of sets and problems. Arithmetical and hyperarithmetical hierarchies (...) and the Turing degrees provide important measures of the level of such difficulty. There are uncountably many Turing degrees and they are partially ordered. These classifications are used in contemporary research to investigate the complexity of problems in modern computable mathematics, for example, regarding structures and their properties. (shrink)

A well known fact is that every Lebesgue measurable set is regular, i.e., it includes an F$_{\sigma}$ set of the same measure. We analyze this fact from a metamathematical or foundational standpoint. We study a family of Muchnik degrees corresponding to measure-theoretic regularity at all levels of the effective Borel hierarchy. We prove some new results concerning Nies's notion of LR-reducibility. We build some $\omega$-models of RCA$_0$which are relevant for the reverse mathematics of measure-theoretic regularity.

We exploit properties of certain directed graphs, obtained from the families of sets with special effective enumeration properties, to generalize several results in computable model theory to higher levels of the hyperarithmetical hierarchy. Families of sets with such enumeration features were previously built by Selivanov, Goncharov, and Wehner. For a computable successor ordinal α, we transform a countable directed graph into a structure such that has a isomorphic copy if and only if has a computable isomorphic copy.A computable (...) structure is categorical if for all computable isomorphic copies of , there is an isomorphism from onto , which is . We prove that for every computable successor ordinal α, there is a computable, categorical structure, which is not relatively categorical. This generalizes the result of Goncharov that there is a computable, computably categorical structure, which is not relatively computably categorical.An additional relation R on the domain of a computable structure is intrinsically on if in all computable isomorphic copies of , the image of R is . We prove that for every computable successor ordinal α, there is an intrinsically relation on a computable structure, which not relatively intrinsically . This generalizes the result of Manasse that there is an intrinsically computably enumerable relation on a computable structure, which is not relatively intrinsically computably enumerable.The dimension of a structure is the number of computable isomorphic copies, up to isomorphisms. We prove that for every computable successor ordinal α and every n≥1, there is a computable structure with dimension n. This generalizes the result of Goncharov that there is a structure of computable dimension n for every n≥1.Finally, we prove that for every computable successor ordinal α, there is a countable structure with isomorphic copies in just the Turing degrees of sets X such that relative to X is not . In particular, for every finite n, there is a structure with isomorphic copies in exactly the non- Turing degrees. This generalizes the result obtained by Wehner, and independently by Slaman, that there is a structure with isomorphic copies in exactly the nonzero Turing degrees. (shrink)

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider only countable members. This paper explores such a notion for classes of computable structures by working out a sequence of examples. We follow recent work by Goncharov and Knight in using the degree of the isomorphism problem for a class to distinguish classifiable classes from non-classifiable. In (...) this paper, we calculate the degree of the isomorphism problem for Abelian p-groups of bounded Ulm length. The result is a sequence of classes whose isomorphism problems are cofinal in the hyperarithmetical hierarchy. In the process, new back-and-forth relations on such groups are calculated. (shrink)

A Π01 class is an effectively closed set of reals. We study properties of these classes determined by cardinality, measure and category as well as by the complexity of the members of a class P. Given an effective enumeration {Pe:e < ω} of the Π01 classes, the index set I for a certain property is the set of indices e such that Pe has the property. For example, the index set of binary Π01 classes of positive measure is Σ02 complete. (...) Various notions of boundedness are discussed and classified. For example, the index set of the recursively bounded classes is Σ03 complete and the index set of the recursively bounded classes which have infinitely many recursive members is Π04 complete. Consideration of the Cantor-Bendixson derivative leads to index sets in the transfinite levels of the hyperarithmetic hierarchy. (shrink)

Infinitary action logic can be naturally expanded by adding exponential and subexponential modalities from linear logic. In this article we shall develop infinitary action logic with a subexponential that allows multiplexing (instead of contraction). Both non-commutative and commutative versions of this logic will be considered, presented as infinitary sequent calculi. We shall prove cut admissibility for these calculi, and estimate the complexity of the corresponding derivability problems: in both cases it will turn out to be between complete first-order arithmetic and (...) the \(\omega ^\omega \) level of the hyperarithmetical hierarchy. Here the complexity upper bound is much lower than that for the system with a subexponential that allows contraction. The complexity lower bound in turn is much higher than that for infinitary action logic. (shrink)

For every partial combinatory algebra, we define a hierarchy of extensionality relations using ordinals. We investigate the closure ordinals of pca’s, i.e., the smallest ordinals where these relations become equal. We show that the closure ordinal of Kleene’s first model is ${\omega _1^{\textit {CK}}}$ and that the closure ordinal of Kleene’s second model is $\omega _1$. We calculate the exact complexities of the extensionality relations in Kleene’s first model, showing that they exhaust the hyperarithmetical hierarchy. We also (...) discuss embeddings of pca’s. (shrink)

We prove that, for each countable ordinal ξ≥1, there exist some -complete ω-powers, and some -complete ω-powers, extending previous works on the topological complexity of ω-powers [O. Finkel, Topological properties of omega context free languages, Theoretical Computer Science 262 669–697; O. Finkel, Borel hierarchy and omega context free languages, Theoretical Computer Science 290 1385–1405; O. Finkel, An omega-power of a finitary language which is a borel set of infinite rank, Fundamenta informaticae 62 333–342; D. Lecomte, Sur les ensembles de (...) phrases infinies constructibles a partir d’un dictionnaire sur un alphabet fini, Séminaire d’Initiation a l’Analyse, 1, année 2001–2002; D. Lecomte, Omega-powers and descriptive set theory, Journal of Symbolic Logic 70 1210–1232; J. Duparc, O. Finkel, An ω-Power of a Context-Free Language Which Is Borel Above , in: S. Bold, B. Löwe, T. Räsch, J. van Benthem , in the Proceedings of the international conference foundations of the formal sciences V : Infinite Games, November 26th to 29th, 2004, Bonn, Germany, in: Studies in Logic, vol. 11, College Publications at King’s College, 2007, pp. 109–122]. We prove effective versions of these results; in particular, for each recursive ordinal there exist some recursive sets A2<ω such that , where and denote classes of the hyperarithmetical hierarchy. To do this, we prove effective versions of a result by Kuratowski, describing a set as the range of a closed subset of the Baire space ωω by a continuous bijection. This leads us to prove closure properties for the pointclasses in arbitrary recursively presented Polish spaces. We apply our existence results to get better computations of the topological complexity of some sets of dictionaries considered in [D. Lecomte, Omega-powers and descriptive set theory, Journal of Symbolic Logic 70 1210–1232]. (shrink)

We consider the complexity (in terms of the arithmetical hierarchy) of the various quantifier levels of the diagram of a computably presented metric structure. As the truth value of a sentence of continuous logic may be any real in [0, 1], we introduce two kinds of diagrams at each level: the closed diagram, which encapsulates weak inequalities of the form $$\phi ^\mathcal {M}\le r$$, and the open diagram, which encapsulates strict inequalities of the form $$\phi ^\mathcal {M}< r$$. We (...) show that the closed and open $$\Sigma _N$$ diagrams are $$\Pi ^0_{N+1}$$ and $$\Sigma ^0_N$$ respectively, and that the closed and open $$\Pi _N$$ diagrams are $$\Pi ^0_N$$ and $$\Sigma ^0_{N + 1}$$ respectively. We then introduce effective infinitary formulas of continuous logic and extend our results to the hyperarithmetical hierarchy. Finally, we demonstrate that our results are optimal. (shrink)

We consider implicit definability over the natural number system $\mathbb{N},+,\times,=$. We present a new proof of two theorems of Leo Harrington. The first theorem says that there exist implicitly definable subsets of $\mathbb{N}$ which are not explicitly definable from each other. The second theorem says that there exists a subset of $\mathbb{N}$ which is not implicitly definable but belongs to a countable, explicitly definable set of subsets of $\mathbb{N}$. Previous proofs of these theorems have used finite- or infinite-injury priority constructions. (...) Our new proof is easier in that it uses only a nonpriority oracle construction, adapted from the standard proof of the Friedberg jump theorem. (shrink)

We analyse the extent of possible computations following Hogarth ([2004]) conducted in Malament–Hogarth (MH) spacetimes, and Etesi and Németi ([2002]) in the special subclass containing rotating Kerr black holes. Hogarth ([1994]) had shown that any arithmetic statement could be resolved in a suitable MH spacetime. Etesi and Németi ([2002]) had shown that some relations on natural numbers that are neither universal nor co-universal, can be decided in Kerr spacetimes, and had asked specifically as to the extent of computational limits there. (...) The purpose of this note is to address this question, and further show that MH spacetimes can compute far beyond the arithmetic: effectively Borel statements (so hyperarithmetic in second-order number theory, or the structure of analysis) can likewise be resolved: Theorem A. If H is any hyperarithmetic predicate on integers, then there is an MH spacetime in which any query ? n H ? can be computed. In one sense this is best possible, as there is an upper bound to computational ability in any spacetime, which is thus a universal constant of that spacetime. Theorem C. Assuming the (modest and standard) requirement that spacetime manifolds be paracompact and Hausdorff, for any spacetime there will be a countable ordinal upper bound, , on the complexity of questions in the Borel hierarchy computable in it. Introduction 1.1 History and preliminaries Hyperarithmetic Computations in MH Spacetimes 2.1 Generalising SADn regions 2.2 The complexity of questions decidable in Kerr spacetimes An Upper Bound on Computational Complexity for Each Spacetime CiteULike Connotea Del.icio.us What's this? (shrink)

This book is a contribution to the flourishing field of formal and philosophical work on truth and the semantic paradoxes. Our aim is to present several theories of truth, to investigate some of their model-theoretic, recursion-theoretic and proof-theoretic aspects, and to evaluate their philosophical significance. In Part I we first outline some motivations for studying formal theories of truth, fix some terminology, provide some background on Tarski’s and Kripke’s theories of truth, and then discuss the prospects of classical type-free truth. (...) In Chapter 4 we discuss some minimal adequacy conditions on a satisfactory theory of truth based on the function that the truth predicate is intended to fulfil on the deflationist account. We cast doubt on the adequacy of some non-classical theories of truth and argue in favor of classical theories of truth. Part II is devoted to grounded truth. In chapter 5 we introduce a game-theoretic semantics for Kripke’s theory of truth. Strategies in these games can be interpreted as reference-graphs of the sentences in question. Using that framework, we give a graph-theoretic analysis of the Kripke-paradoxical sentences. In chapter 6 we provide simultaneous axiomatizations of groundedness and truth, and analyze the proof-theoretic strength of the resulting theories. These range from conservative extensions of Peano arithmetic to theories that have the full strength of the impredicative system ID1. Part III investigates the relationship between truth and set-theoretic comprehen- sion. In chapter 7 we canonically associate extensions of the truth predicate with Henkin-models of second-order arithmetic. This relationship will be employed to determine the recursion-theoretic complexity of several theories of grounded truth and to show the consistency of the latter with principles of generalized induction. In chapter 8 it is shown that the sets definable over the standard model of the Tarskian hierarchy are exactly the hyperarithmetical sets. Finally, we try to apply a certain solution to the set-theoretic paradoxes to the case of truth, namely Quine’s idea of stratification. This will yield classical disquotational theories that interpret full second-order arithmetic without set parameters, Z2- . We also indicate a method to recover the parameters. An appendix provides some background on ordinal notations, recursion theory and graph theory. (shrink)

The main result proved in the paper is that on every recursive structure the intrinsically hyperarithmetical sets coincide with the relatively intrinsically hyperarithmetical sets. As a side effect of the proof an effective version of the Kueker's theorem on definability by means of infinitary formulas is obtained.

Let be a model of a theory T. Depending on wether is decidable or recursive, and on whether T is strongly minimal or -minimal, we find conditions on which guarantee that every infinite independent subset of is not recursively enumerable. For each of the same four cases we also find conditions on which guarantee that every infinite independent subset of has Turing degree 0'. More generally, let be a recursive -structure, R a relation symbol not in , ψ a recursive (...) infiniatary Π2 sentence in the language {R}, and let 0<α<ωCK1. We discuss conditions under which we can construct a recursive -structure such that ,Rψ for every Δ0α relation R on. (shrink)

In spite of feminist recognition that hierarchical organizations are an important location of male dominance, most feminists writing about organizations assume that organizational structure is gender neutral. This article argues that organizational structure is not gender neutral; on the contrary, assumptions about gender underlie the documents and contracts used to construct organizations and to provide the commonsense ground for theorizing about them. Their gendered nature is partly masked through obscuring the embodied nature of work.jobs and hierarchies, common concepts in organizational (...) thinking, assume a disembodies and universal worker. This worker is actually a man; men's bodies, sexuality, and relationships to procreation and paid work are subsumed in the image of the worker. Images of men's bodies and masculinity pervade organizational processes, marginalizing women and contributing to the maintenance of gender segregation in organizations. The positing of gender-neutral and disembodied organizational structures and work relations is part of the larger strategy of control in industrial capitalist societies, which, at least partly, are built upon a deeply embedded substructure of gender difference. (shrink)

In this article, we will present a number of technical results concerning Classical Logic, ST and related systems. Our main contribution consists in offering a novel identity criterion for logics in general and, therefore, for Classical Logic. In particular, we will firstly generalize the ST phenomenon, thereby obtaining a recursively defined hierarchy of strict-tolerant systems. Secondly, we will prove that the logics in this hierarchy are progressively more classical, although not entirely classical. We will claim that a logic (...) is to be identified with an infinite sequence of consequence relations holding between increasingly complex relata: formulae, inferences, metainferences, and so on. As a result, the present proposal allows not only to differentiate Classical Logic from ST, but also from other systems sharing with it their valid metainferences. Finally, we show how these results have interesting consequences for some topics in the philosophical logic literature, among them for the debate around Logical Pluralism. The reason being that the discussion concerning this topic is usually carried out employing a rivalry criterion for logics that will need to be modified in light of the present investigation, according to which two logics can be non-identical even if they share the same valid inferences. (shrink)

Two linear orderings are equimorphic if each can be embedded into the other. We prove that every hyperarithmetic linear ordering is equimorphic to a recursive one. On the way to our main result we prove that a linear ordering has Hausdorff rank less than $\omega _{1}^{\mathit{CK}}$ if and only if it is equimorphic to a recursive one. As a corollary of our proof we prove that, given a recursive ordinal α, the partial ordering of equimorphism types of linear orderings of (...) Hausdorff rank at most α ordered by embeddablity is recursively presentable. (shrink)

Large scale experiments at CERN’s Large Hadron Collider rely heavily on computer simulations, a fact that has recently caught philosophers’ attention. CSs obviously require appropriate modeling, and it is a common assumption among philosophers that the relevant models can be ordered into hierarchical structures. Focusing on LHC’s ATLAS experiment, we will establish three central results here: with some distinct modifications, individual components of ATLAS’ overall simulation infrastructure can be ordered into hierarchical structures. Hence, to a good degree of approximation, hierarchical (...) accounts remain valid at least as descriptive accounts of initial modeling steps. In order to perform the epistemic function Winsberg Model-based reasoning in scientific discovery. Kluwer Academic/plenum Publishers, New York, pp 255–269, 1999) assigns to models in simulation—generate knowledge through a sequence of skillful but non-deductive transformations—ATLAS’ simulation models have to be considered part of a network rather than a hierarchy, in turn making the associated simulation modeling messy rather than motley. Deriving knowledge-claims from this ‘mess’ requires two sources of justification: holistic validation :253–262, 2010; in Carrier M, Nordmann A Science in the context of application. Springer, Berlin, pp 115–130, 2011), and model coherence. As it turns out, the degree of model coherence sets HEP apart from other messy, simulation-intensive disciplines such as climate science, and the reasons for this are to be sought in the historical, empirical and theoretical foundations of the respective discipline. (shrink)

Applied Evolutionary Epistemology is a scientific-philosophical theory that defines evolution as the set of phenomena whereby units evolve at levels of ontological hierarchies by mechanisms and processes. This theory also provides a methodology to study evolution, namely, studying evolution involves identifying the units that evolve, the levels at which they evolve, and the mechanisms and processes whereby they evolve. Identifying units and levels of evolution in turn requires the development of ontological hierarchy theories, and examining mechanisms and processes necessitates (...) theorizing about causality. Together, hierarchy and causality theories explain how biorealities form and diversify with time. This paper analyzes how Applied EE redefines both hierarchy and causality theories in the light of the recent explosion of network approaches to causal reasoning associated with studies on reticulate and macroevolution. Causality theories have often been framed from within a rigid, ladder-like hierarchy theory where the rungs of the ladder represent the different levels, and the elements on the rungs represent the evolving units. Causality then is either defined reductionistically as an upward movement along the strands of a singular hierarchy, or holistically as a downward movement along that same hierarchy. Upward causation theories thereby analyze causal processes in time, i.e. over the course of natural history or phylogenetically, as Darwin and the founders of the Modern Synthesis intended. Downward causation theories analyze causal processes in space, ontogenetically or ecologically, as the current eco-evo-devo schools are evidencing. This work demonstrates how macroevolution and reticulate evolution theories add to the complexity by examining reticulate causal processes in space–time, and the interactional hierarchies that such studies bring forth introduce a new form of causation that is here called reticulate causation. Reticulate causation occurs between units and levels belonging to different as well as to the same ontological hierarchies. This article concludes that beyond recognizing the existence of multiple units, levels, and mechanisms or processes of evolution, also the existence of multiple kinds of evolutionary causation as well as the existence of multiple evolutionary hierarchies needs to be acknowledged. This furthermore implies that evolution is a pluralistic process divisible into different kinds. (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.

A trenchant defense of hierarchy in different spheres of our lives, from the personal to the political All complex and large-scale societies are organized along certain hierarchies, but the concept of hierarchy has become almost taboo in the modern world. Just Hierarchy contends that this stigma is a mistake. In fact, as Daniel Bell and Wang Pei show, it is neither possible nor advisable to do away with social hierarchies. Drawing their arguments from Chinese thought and culture (...) as well as other philosophies and traditions, Bell and Wang ask which forms of hierarchy are justified and how these can serve morally desirable goals. They look at ways of promoting just forms of hierarchy while minimizing the influence of unjust ones, such as those based on race, sex, or caste. Which hierarchical relations are morally justified and why? Bell and Wang argue that it depends on the nature of the social relation and context. Different hierarchical principles ought to govern different kinds of social relations: what justifies hierarchy among intimates is different from what justifies hierarchy among citizens, countries, humans and animals, and humans and intelligent machines. Morally justified hierarchies can and should govern different spheres of our social lives, though these will be very different from the unjust hierarchies that have governed us in the past. A vigorous, systematic defense of hierarchy in the modern world, Just Hierarchy examines how hierarchical social relations can have a useful purpose, not only in personal domains but also in larger political realms. (shrink)

A statement of hyperarithmetic analysis is a sentence of second order arithmetic S such that for every Y⊆ω, the minimum ω-model containing Y of RCA0 + S is HYP, the ω-model consisting of the sets hyperarithmetic in Y. We provide an example of a mathematical theorem which is a statement of hyperarithmetic analysis. This statement, that we call INDEC, is due to Jullien [13]. To the author's knowledge, no other already published, purely mathematical statement has been found with this property (...) until now. We also prove that, over RCA0, INDEC is implied by [Formula: see text] and implies ACA0, but of course, neither ACA0, nor ACA 0+ imply it. We introduce five other statements of hyperarithmetic analysis and study the relations among them. Four of them are related to finitely-terminating games. The fifth one, related to iterations of the Turing jump, is strictly weaker than all the other statements that we study in this paper, as we prove using Steel's method of forcing with tagged trees. (shrink)

Investigates the resolution of contradictions and ambiguous derogations in a code, by means of the imposition of partial orderings.

This paper seeks to resolve a fairly simple question in ethics: Why do seemingly reasonable people disagree about ethical problems? My paper seeks both to analyze this question and attempts to find a solution. My premise is that disagreement happens because of differences in hierarchical value ranking, or quite simply because some problems are more important to some people than others. Theories of choice, however, influenced by concepts such as "freedom of choice," conceal the hierarchical nature of our choices, leading (...) to confusion over the nature and degree of our ethical disagreements. I propose then that ethical disagreements can be reduced when we understand hierarchy as an essential element in moral choice theory. (shrink)

Research from ethology and evolutionary biology indicates the following about the evolution of reasoning capacity. First, solving problems of social competition and cooperation have direct impact on survival rates and reproductive success. Second, the social structure that evolved from this pressure is the dominance hierarchy. Third, primates that live in large groups with complex dominance hierarchies also show greater neocortical development, and concomitantly greater cognitive capacity. These facts suggest that the necessity of reasoning effectively about dominance hierarchies left an (...) indelible mark on primate reasoning architectures, including that of humans. In order to survive in a dominance hierarchy, an individual must be capable of (a) making rank discriminations, (b) recognizing what is forbidden and what is permitted based one's rank, and (c) deciding whether to engage in or refriin from activities that will allow one to move up in rank. The first problem is closely tied to the capacity for transitive reasoning, while the second and third are intimately related to the capacity for deontic reasoning. I argue that the human capacity for these types of reasoning have evolutionary roots that reach deeper into our ancestral past than the emergence of the hominid line, and the operation of these evolutionarily primitive reasoning systems can be seen in the development of human reasoning and domain-specific effects in adult reasoning. (shrink)

A trenchant defense of hierarchy in different spheres of our lives, from the personal to the political All complex and large-scale societies are organized along certain hierarchies, but the concept of hierarchy has become almost taboo in the modern world. Just Hierarchy contends that this stigma is a mistake. In fact, as Daniel Bell and Wang Pei show, it is neither possible nor advisable to do away with social hierarchies. Drawing their arguments from Chinese thought and culture (...) as well as other philosophies and traditions, Bell and Wang ask which forms of hierarchy are justified and how these can serve morally desirable goals. They look at ways of promoting just forms of hierarchy while minimizing the influence of unjust ones, such as those based on race, sex, or caste. Which hierarchical relations are morally justified and why? Bell and Wang argue that it depends on the nature of the social relation and context. Different hierarchical principles ought to govern different kinds of social relations: what justifies hierarchy among intimates is different from what justifies hierarchy among citizens, countries, humans and animals, and humans and intelligent machines. Morally justified hierarchies can and should govern different spheres of our social lives, though these will be very different from the unjust hierarchies that have governed us in the past. A vigorous, systematic defense of hierarchy in the modern world, Just Hierarchy examines how hierarchical social relations can have a useful purpose, not only in personal domains but also in larger political realms. (shrink)

Contemporary evolutionary biology comprises a plural landscape of multiple co-existent conceptual frameworks and strenuous voices that disagree on the nature and scope of evolutionary theory. Since the mid-eighties, some of these conceptual frameworks have denounced the ontologies of the Modern Synthesis and of the updated Standard Theory of Evolution as unfinished or even flawed. In this paper, we analyze and compare two of those conceptual frameworks, namely Niles Eldredge’s Hierarchy Theory of Evolution (with its extended ontology of evolutionary entities) (...) and the Extended Evolutionary Synthesis (with its proposal of an extended ontology of evolutionary processes), in an attempt to map some epistemic bridges (e.g. compatible views of causation; niche construction) and some conceptual rifts (e.g. extra-genetic inheritance; different perspectives on macroevolution; contrasting standpoints held in the “externalism–internalism” debate) that exist between them. This paper seeks to encourage theoretical, philosophical and historiographical discussions about pluralism or the possible unification of contemporary evolutionary biology. (shrink)

This article uses social dominance theory (SDT) to explore the dynamic and systemic nature of the initiation and maintenance of organizational corruption. Rooted in the definition of organizational corruption as misuse of power or position for personal or organizational gain, this work suggests that organizational corruption is driven by the individual and institutional tendency to structure societies as group-based social hierarchies. SDT describes a series of factors and processes across multiple levels of analysis that systemically contribute to the initiation and (...) maintenance of social hierarchies and associated power inequalities, favoritism, and discrimination. I posit that the same factors and processes also contribute to individuals’ lower awareness of the misuse of power and position within the social hierarchies, leading to the initiation and maintenance of organizational corruption. Specifically, individuals high in social dominance orientation, believing that they belong to superior groups, are likely to be less aware of corruption because of their feeling of entitlement to greater power and their desire to maintain dominance even if that requires exploiting others. Members of subordinate groups are also likely to have lower awareness of corruption if they show more favoritism toward dominant group members to enhance their sense of worth and preserve social order. Institutions contribute to lower awareness of corruption by developing and enforcing structures, norms, and practices that promote informational ambiguity and maximize focus on dominance and promotion. Dynamic coordination among individuals and institutions is ensured through the processes of person-environment fit and legitimizing beliefs, ideologies, or rationalizations. (shrink)

The question whether Frege’s theory of indirect reference enforces an infinite hierarchy of senses has been hotly debated in the secondary literature. Perhaps the most influential treatment of the issue is that of Burge (1979), who offers an argument for the hierarchy from rather minimal Fregean assumptions. I argue that this argument, endorsed by many, does not itself enforce an infinite hierarchy of senses. I conclude that whether or not the theory of indirect reference can avail itself (...) of only finitely many senses is pending further theoretical development. (shrink)