We show that there is a cuppable c.e. degree, all of whose cupping partners are high. In particular, not all cuppable degrees are${\operatorname {\mathrm {low}}}_3$-cuppable, or indeed${\operatorname {\mathrm {low}}}_n$cuppable for anyn, refuting a conjecture by Li. On the other hand, we show that one cannot improve highness to superhighness. We also show that the${\operatorname {\mathrm {low}}}_2$-cuppable degrees coincide with the array computable-cuppable degrees, giving a full understanding of the latter class.

We show that there is a generalized high degree which is a minimal cover of a minimal degree. This is the highest jump class one can reach by finite iterations of minimality. This result also answers an old question by Lerman.

We prove that for every ${\mathrm{\Sigma }}_{2}^{0}$ enumeration degree b there exists a noncuppable ${\mathrm{\Sigma }}_{2}^{0}$ degree a > 0 e such that b′ ≤ e a′ and a″ ≤ e b″. This allows us to deduce, from results on the high/low jump hierarchy in the local Turing degrees and the jump preserving properties of the standard embedding l: D T → D e , that there exist ${\mathrm{\Sigma }}_{2}^{0}$ noncuppable enumeration degrees at every possible—i.e., above low₁—level of (...) the high/low jump hierarchy in the context of D e. (shrink)

A queue‐jumping argument concludes that some course of action is impermissible by likening it to the presumptively impermissible act of jumping a queue. Arguments of this sort may be found in a disparate range of contexts and in support of policies favoured by both left and right. Examples include arguments against private education and private health care but also arguments against accommodations for learning disabilities, refugee resettlement, and birthright citizenship. We infer that, although queue‐jumping arguments are strictly analogies, they constitute (...) a sufficiently distinct class of arguments to justify their separate treatment. The paper proposes an argumentation scheme for queue‐jumping arguments and demonstrates its applicability to some existing arguments of this type. (shrink)

The jump operator on the ω-enumeration degrees was introduced in [I.N. Soskov, The ω-enumeration degrees, J. Logic Computat. 17 1193–1214]. In the present paper we prove a jump inversion theorem which allows us to show that the enumeration degrees are first order definable in the structure of the ω-enumeration degrees augmented by the jump operator. Further on we show that the groups of the automorphisms of and of the enumeration degrees are isomorphic. In the second part of (...) the paper we study the jumps of the ω-enumeration degrees below . We define the ideal of the almost zero degrees and obtain a natural characterization of the class H of the ω-enumeration degrees below which are high n for some n and of the class L of the ω-enumeration degrees below which are low n for some n. (shrink)

In [9]. Yates proved the existence of a Turing degree a such that 0. 0′ are the only c.e. degrees comparable with it. By Slaman and Steel [7], every degree below 0′ has a 1-generic complement, and as a consequence. Yates degrees can be 1-generic, and hence can be low. In this paper, we prove that Yates degrees occur in every jump class.

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)

We consider the set of jumps below a Turing degree, given by JB={x':x≤a}, with a focus on the problem: Which recursively enumerable degrees a are uniquely determined by JB? Initially, this is motivated as a strategy to solve the rigidity problem for the partial order R of r.e. degrees. Namely, we show that if every high2 r.e. degree a is determined by JB, then R cannot have a nontrivial automorphism. We then defeat the strategy—at least in the form presented—by constructing (...) pairs a0, a1 of distinct r.e. degrees such that JB=JB within any possible jump class {x:x'=c}. We give some extensions of the construction and suggest ways to salvage the attack on rigidity. (shrink)

A uniform upper bound on a class of Turing degrees is the Turing degree of a function which parametrizes the collection of all functions whose degree is in the given class. I prove that if a is a uniform upper bound on an ideal of degrees then a is the jump of a degree c with this additional property: there is a uniform bound b<a so that b V c < a.

We study inversions of the jump operator on ${\mathrm{\Pi }}_{1}^{0}$ classes, combined with certain basis theorems. These jump inversions have implications for the study of the jump operator on the random degrees—for various notions of randomness. For example, we characterize the jumps of the weakly 2-random sets which are not 2-random, and the jumps of the weakly 1-random relative to 0′ sets which are not 2-random. Both of the classes coincide with the degrees above 0′ (...) which are not 0′-dominated. A further application is the complete solution of [24, Problem 3.6.9]: one direction of van Lambalgen's theorem holds for weak 2-randomness, while the other fails. Finally we discuss various techniques for coding information into incomplete randoms. Using these techniques we give a negative answer to [24, Problem 8.2.14]: not all weakly 2-random sets are array computable. In fact, given any oracle X, there is a weakly 2-random which is not array computable relative to X. This contrasts with the fact that all 2-random sets are array computable. (shrink)

The catalogue raisonné compiled by art scholars holds information about an artist’s work such as a painting’s image, medium, provenance, and title. The catalogue raisonné as a tangible asset suffers from the challenges of art authentication and impermanence. As the catalogue raisonné is born digital, the impermanence challenge abates, but the authentication challenge persists. With the popularity of artificial intelligence and its deep learning architectures of computer vision, we propose to address the authentication challenge by creating a new artefact for (...) the digital catalogue raisonné: a digital classification model. This digital classification model will help art scholars with new artwork claims via a tool that authenticates a proposed artwork with an artist. We create this tool by training a machine learning model with 90 artists having at least 150 artworks and achieve an accuracy of 87.31%. We use the ResNet Convolutional Neural Network to improve accuracy and number of artist classes over state-of-the-art artist classification experiments using the WikiArt database. We address inconsistencies in the way scholars approach artist classification by providing a consistent method to recreate our dataset and providing a consistent method to calculate performance metrics based on imbalanced data. (shrink)

We study the following classes: Q* (r 1 A 1 ,..., r kA k ) which is defined to be the collection of all sets that can be computed by a Turing machine that on any input makes a total of r i queries to A i for all i ∈ {1,..., k}. Q(r 1A 1 ,...,r kA k ) which is defined like Q* (r 1A 1 ,..., r kA k ) except that queries to A i must (...) be made before queries to A i+1 for all i ∈ {1,..., k - 1}. QC(r 1A 1 ,..., r kA k ) which is defined like Q(r 1A 1 ,..., r kA k ) except that the Turing machine must halt even if given incorrect answers to some of its queries. We show that if A 1 ,..., A k are jumps that are not too close together, then all three of these classes are identical and are not changed if we permute (r 1A 1 ,..., r kA k ). This extends a result of Beigel's [1]. Since the second class is not affected by permutations, we say that these sets commute with each other. We also show that jumps that are too close together may not commute. We also characterize the commutative sequences of sets obtained by iterating the jump operation through an ordinal notation. (shrink)

We show that the e-degree 0'e and the map u ↦ u' are definable in the upper semilattice of all e-degrees. The class of total e-degrees ≥0'e is also definable.

We study the relationship between effective domination properties and the bounded jump. We answer two open questions about the bounded jump: We prove that the analogue of Sacks jump inversion fails for the bounded jump and the wtt-reducibility. We prove that no c.e. bounded high set can be low by showing that they all have to be Turing complete. We characterize the class of c.e. bounded high sets as being those sets computing the Halting problem via (...) a reduction with use bounded by an ω-c.e. function. We define several notions of a c.e. set being effectively dominant, and show that together with the bounded high sets they form a proper hierarchy. (shrink)

This paper presents a lesson plan originally designed for applied ethics classes filled with primarily white, conservative students. In an environment where students used the terminology of “reverse discrimination” and “quotas” rather than “Affirmative Action,” the author employs a fictionalized example of a claim jumper and the rightful owner’s entitlement to the claim in order to present basic arguments for compensatory justice. These arguments are extended by analogy to the issue of Affirmative Action in order to deliver several key (...) points: First, the “discrimination” of Affirmative Action programs is restitution, even if modern white people are not responsible for the privilege they possess, and thus Affirmative Action is not the same as the discrimination suffered by African-Americans. Second, an extraordinarily high number of African-Americans are still suffering as a result of past injustices. Third, while theoretical opportunity may exist for African-Americans today, true equal opportunity does not. Appended to this paper are a number of statistics relevant to the Affirmative Action debate and an Affirmative Action bibliography. (shrink)

The H ∞ performance of a class of T-S fuzzy systems with Markovian-jump parameters is analyzed. A state feedback controller is designed for T-S fuzzy systems with Markovian-jump parameters. First, a new modal-dependent Lyapunov function composed of closed-loop functions is constructed, which can fully use system status information. Based on this function, the stability conditions with less conservatism are given by linear matrix inequalities. At the same time, a design algorithm for a state feedback controller is proposed for (...) the Markovian-jump-parameters T-S fuzzy systems, which ensures the system’s stability under the condition of H ∞ − γ performance. Simulation results demonstrate that the mentioned method is accurate and practical. (shrink)

This work is devoted to studying the stochastic stabilization of a class of neutral-type complex-valued neural networks with partly unknown Markov jump. Firstly, in order to reduce the conservation of our stability conditions, two integral inequalities are generalized to the complex-valued domain. Secondly, a state-feedback controller is designed to investigate the stability of the neutral-type CVNNs with H ∞ performance, making the stability problem a further extension, and then, the stabilization of the CVNNs with H ∞ performance is investigated (...) through a sampling-based event-triggered control for the first time that the transmission event is not triggered except when it violates the event-triggered condition. Finally, two examples are given to illustrate the validity and correctness of our obtained theorems. (shrink)

This paper addresses the robust stabilization problem for a class of stochastic Markovian jump systems with distributed delays. The systems under consideration involve Brownian motion, Markov chains, distributed delays, and parameter uncertainties. By an appropriate Lyapunov–Krasovskii functional, the novel delay-dependent stabilization criterion for the stochastic Markovian jump systems is derived in terms of linear matrix inequalities. When given linear matrix inequalities are feasible, an explicit expression of the desired state feedback controller is given. The designed controller, based on (...) the obtained criterion, ensures asymptotically stable in the mean square sense of the resulting closed-loop system. The convenience of the design is greatly enhanced due to the existence of an adjustable parameter in the controller. Finally, a numerical example is exploited to demonstrate the effectiveness of the developed theory. (shrink)

The Probably Approximately Correct (PAC) learning is a machine learning model introduced by Leslie Valiant in 1984. The PACi reducibility refers to the PAC reducibility independent of size and computation time. This reducibility in PAC learning resembles the reducibility in Turing computability. The ordering of concept classes under PAC reducibility is nonlinear, even when restricted to particular concrete examples.Due to the resemblance to Turing Reducibility, we suspected that there could be incomparable PACi and PAC degrees for the PACi and (...) PAC reducibilities as in Turing incomparable degrees. In 1957 Friedberg and in 1956 Muchnik independently solved the Post problem by constructing computably enumerable sets A and B of incomparable degrees using the priority construction method. We adapt this idea to PACi and PAC reducibilities and construct two effective concept classes C and D such that C is not reducible to D and vice versa. When considering PAC reducibility it was necessary to work on the size of an effective concept class, thus we use Kolmogorov complexity to obtain the size. The non-learnability of concept classes in the PAC learning model is explained by the existence of PAC incomparable degrees.Analogous to the Turing jump, we give a jump operation on effective concept classes for the zero jump. To define the zero jump operator for PACi degrees the join of all the effective concept classes is constructed and proved that it is a greatest element. There are many properties proven for existing degrees. Thus we can explore proving those properties to PACi and PAC degrees. But if we prove an embedding from those degrees to PACi and PAC degrees then those properties will be true for PACi and PAC degrees without explicitly proving them.Abstract prepared by Dodamgodage Gihnee M. Senadheera and taken directly from the thesisE-mail: [email protected]: https://www.proquest.com/docview/2717762461/abstract/ACD19F29A8774AF6PQ/1?accountid=13864. (shrink)

Inhalt: Vorbemerkung Kommentar Titel Vorrede Erster Teil Zweiter Teil Dritter Teil Benutzte Literatur a)Zeitgenossen und Vorläufer Fichtes b)Moderne Interpreten Sachregister zum Fichte-Text Verzeichnis der zitierten Arbeiten Fichtes.

The present "philological commentary" is directed at those who have decided to take time for reading the original text, at least in an English translation. The first volume "Textual Criticism" is intended to meet the difficulties caused by the fact that our text editions are based on manuscripts separated from the original by more than a millennium.

With the third volume, it is invited to enter the intellectual environment of Aristotle. The most relevant sources are given in full (with English translation), so that the commentary is also a reader documenting the disputationes metaphysicae of the 4th century BC. For the undeniable contradictions in the Metaphysics, a new genetic explanation is offered.

Though since Werner Jaeger's famous Studien zur Entstehungsgeschichte der Metaphysik des Aristoteles of 1912 remarkable observations were made, the topic "Composition of the Metaphysics" almost disappeared from the agenda. As, however, neglect of this philological task results in either selective reading or anachronistic systematization, the author has resumed it, extending it to the internal structure of the singular books.

Though since Werner Jaeger's famous Studien zur Entstehungsgeschichte der Metaphysik des Aristoteles of 1912 remarkable observations were made, the topic "Composition of the Metaphysics" almost disappeared from the agenda. As, however, neglect of this philological task results in either selective reading or anachronistic systematization, the author has resumed it, extendig it to the internal structure of the singular books.

The question of the relationship between ontology and theology, the main problem of the interpretation in volume 3, is also the guiding question of our last volume. The history of metaphysics is a history of the efforts towards an outlook on the world and life, which are about the meaning and connection of fundamental concepts: being, life, intellect, unity, truth, goodness. From these, the concept of divinity is derived. As in the previous volumes, a rich material of original texts and (...) interpretations is spread out. (shrink)

When a professor from Middle Europe teaches Computer Ethics in the Middle East using a textbook from the US, cultural differences become apparent. A main challenge lies in avoiding cultural imperialism during teaching. In order to meet this challenge, personal portfolios have been used for course work. The course design as well as portfolio tasks are presented and experiences are discussed. Based on our experiences we recommend applying this approach to equally overcome effects of group dynamics in similar courses as (...) well as to bridge the generational gap that normally exists between students and professors. (shrink)

Malgré sa défiance pour la théorie, la recherche scientifique de Goethe n’est pas allée sans un soin tout particulier porté à la méthode qu’elle devait mettre en œuvre. Précisément parce qu’il fallait rendre compte du phénomène dans sa diversité et dans sa totalité, il importait de réfléchir aux moyens qui assureraient la réussite d’une telle démarche. Pour Goethe, il s’agissait de mettre en œuvre un concours harmonieux des différentes facultés de l’esprit humain, seul capable de répondre à la richesse du (...) réel tel qu’il se manifeste à nous, et donc seul capable de fonder adéquatement une démarche expérimentale en science. (shrink)

Der vorliegende "philologische" Kommentar beansprucht Kants Critik der reinen Vernunft aus ihren historischen Voraussetzungen zu erklären. Zu diesen gehört an erster Stelle Kants Sprache; sie ist nicht mehr die unsere, was den unvorbereiteten Leser von heute schon an der Semantik und Syntax vieler Sätze scheitern lässt. Neben einer Fülle von sprachlichen Erläuterungen und textkritischen Untersuchungen bringt der Kommentar reichliche Zitate aus den von Kant benutzten Logik- und Metaphysik-Lehrbüchern, die seine Rezeption der "dogmatischen" Philosophie Christian Wolffs und seiner Nachfolger belegen; lateinische (...) Texte werden dabei sowohl im Original als auch in deutscher Übersetzung geboten. Einzelne Motive werden ideengeschichtlich bis in die Antike zurückverfolgt; hieraus eröffnen sich Perspektiven für eine "Metakritik" von einem "vorkritischen" Standpunkt aus, die im Rahmen eines philologischen Kommentars nur angedeutet werden können. (shrink)

Objective Apeiron was founded in 1966 and has developed into one of the oldest and most distinguished journals dedicated to the study of ancient philosophy, ancient science, and, in particular, of problems that concern both fields. Apeiron is committed to publishing high-quality research papers in these areas of ancient Greco-Roman intellectual history; it also welcomes submission of articles dealing with the reception of ancient philosophical and scientific ideas in the later western tradition. The journal appears quarterly. Articles are peer-reviewed on (...) a double-blind basis. Topics ancient philosophy ancient science reception of ancient philosophical and scientific ideas in the later western tradition Article formats Original Articles. (shrink)

We focus on a particular class of computably enumerable degrees, the array noncomputable degrees defined by Downey, Jockusch, and Stob, to answer questions related to lattice embeddings and definability in the partial ordering of c. e. degrees under Turing reducibility. We demonstrate that the latticeM5 cannot be embedded into the c. e. degrees below every array noncomputable degree, or even below every nonlow array noncomputable degree. As Downey and Shore have proved that M5 can be embedded below every nonlow2 degree, (...) our result is the best possible in terms of array noncomputable degrees and jump classes. Further, this result shows that the array noncomputable degrees are definably different from the nonlow2 degrees. We note also that there are embeddings of M5 in which all five degrees are array noncomputable, and in which the bottom degree is the computable degree 0 but the other four are array noncomputable. (shrink)

Cooper proved in [S.B. Cooper, Strong minimal covers for recursively enumerable degrees, Math. Logic Quart. 42 191–196] the existence of a c.e. degree with a strong minimal cover . So is the greastest c.e. degree below . Cooper and Yi pointed out in [S.B. Cooper, X. Yi, Isolated d.r.e. degrees, University of Leeds, Dept. of Pure Math., 1995. Preprint] that this strongly minimal cover cannot be d.c.e., and meanwhile, they proposed the notion of isolated degrees: a d.c.e. degree is isolated (...) by a c.e. degree if is the greatest c.e. degree below , and we also say that isolates . In [G. Wu, Bi-isolation in the d.c.e. degrees, J. Symbolic Logic 69 409–420], Wu extended Cooper–Yi’s notion and proved that there are intervals of d.c.e. degrees containing exactly one c.e. degree . Following Cooper and Yi’s notion, is called a bi-isolating degree. The bi-isolating degrees are dense in the high c.e. degrees. Arslanov asked whether the bi-isolating degrees occur in every jump class. In this paper, we prove that there are low bi-isolating degrees, providing a partial solution to Arslanov’s question. (shrink)

Examining various kinds of isolation phenomena in the Turing degrees, I show that there are, for every n>0, (n+1)-c.e. sets isolated in the n-CEA degrees by n-c.e. sets below them. For n≥1 such phenomena arise below any computably enumerable degree, and conjecture that this result holds densely in the c.e. degrees as well. Surprisingly, such isolation pairs also exist where the top set has high degree and the isolating set is low, although the complete situation for jump classes (...) remains unknown. (shrink)

The text is concerned with a class of two-sided stochastic processes of the form. Here is a two-sided Brownian motion with random initial data at time zero and is a function of. Elements of the related stochastic calculus are introduced. In particular, the calculus is adjusted to the case when is a jump process. Absolute continuity of under time shift of trajectories is investigated. For example under various conditions on the initial density with respect to the Lebesgue measure,, and (...) on with we verify i.e. where the product is taken over all coordinates. Here is the divergence of with respect to the initial position. Crucial for this is the temporal homogeneity of in the sense that,, where is the trajectory taking the constant value. By means of such a density, partial integration relative to a generator type operator of the process is established. Relative compactness of sequences of such processes is established. (shrink)

Assuming the existence of a monster model, tameness, and continuity of nonsplitting in an abstract elementary class (AEC), we extend known superstability results: let $\mu>\operatorname {LS}(\mathbf {K})$ be a regular stability cardinal and let $\chi $ be the local character of $\mu $ -nonsplitting. The following holds: 1.When $\mu $ -nonforking is restricted to $(\mu,\geq \chi )$ -limit models ordered by universal extensions, it enjoys invariance, monotonicity, uniqueness, existence, extension, and continuity. It also has local character $\chi $. This generalizes (...) Vasey’s result [37, Corollary 13.16] which assumed $\mu $ -superstability to obtain same properties but with local character $\aleph _0$.2.There is $\lambda \in [\mu,h(\mu ))$ such that if $\mathbf {K}$ is stable in every cardinal between $\mu $ and $\lambda $, then $\mathbf {K}$ has $\mu $ -symmetry while $\mu $ -nonforking in (1) has symmetry. In this case:(a) $\mathbf {K}$ has the uniqueness of $(\mu,\geq \chi )$ -limit models: if $M_1,M_2$ are both $(\mu,\geq \chi )$ -limit over some $M_0\in K_{\mu }$, then $M_1\cong _{M_0}M_2$ ;(b)any increasing chain of $\mu ^+$ -saturated models of length $\geq \chi $ has a $\mu ^+$ -saturated union. These generalize [31] and remove the symmetry assumption in [10, 38].Under $(<\mu )$ -tameness, the conclusions of (1), (2)(a)(b) are equivalent to $\mathbf {K}$ having the $\chi $ -local character of $\mu $ -nonsplitting.Grossberg and Vasey [18, 38] gave eventual superstability criteria for tame AECs with a monster model. We remove the high cardinal threshold and reduce the cardinal jump between equivalent superstability criteria. We also add two new superstability criteria to the list: a weaker version of solvability and the boundedness of the U-rank. (shrink)

We show that the class of strongly jump-traceable c.e. sets can be characterised as those which have sufficiently slow enumerations so they obey a class of well-behaved cost functions, called benign. This characterisation implies the containment of the class of strongly jump-traceable c.e. Turing degrees in a number of lowness classes, in particular the classes of the degrees which lie below incomplete random degrees, indeed all LR-hard random degrees, and all ω-c.e. random degrees. The last result (...) implies recent results of Diamondstone's and Ng's regarding cupping with superlow c.e. degrees and thus gives a use of algorithmic randomness in the study of the c.e. Turing degrees. (shrink)

Enumeration reducibility is a notion of relative computability between sets of natural numbers where only positive information about the sets is used or produced. Extending e‐reducibility to partial functions characterises relative computability between partial functions. We define a polynomial time enumeration reducibility that retains the character of enumeration reducibility and show that it is equivalent to conjunctive non‐deterministic polynomial time reducibility. We define the polynomial time e‐degrees as the equivalence classes under this reducibility and investigate their structure on the (...) recursive sets, showing in particular that the pe‐degrees of the computable sets are dense and do not form a lattice, but that minimal pairs exist. We define a jump operator and use it to produce a characterisation of the polynomial hierarchy. (shrink)