scientific article

Publication date: 5 June 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

priority degrees recursively enumerable sets injury

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory (03Dxx)

Related Items (only showing first 100 items - show all)

An inside/outside Ramsey theorem and recursion theory ⋮ Notions of robust information coding ⋮ On the classification of computable languages ⋮ The complexity of universal text-learners ⋮ Generically and coarsely computable isomorphisms ⋮ HTP-COMPLETE RINGS OF RATIONAL NUMBERS ⋮ Cousin’s lemma in second-order arithmetic ⋮ Fixpoints and relative precompleteness ⋮ Members of thin Π₁⁰ classes and generic degrees ⋮ Unnamed Item ⋮ Any FIP real computes a 1-generic ⋮ INITIAL SEGMENTS OF THE DEGREES OF CEERS ⋮ Agreement reducibility ⋮ r‐Maximal sets and Q1,N‐reducibility ⋮ Limit computability and ultrafilters ⋮ Two theorems on minimal generalized computable numberings ⋮ Numberings, c.e. oracles, and fixed points ⋮ A class of low linear orders having computable presentations ⋮ On the complexity of the theory of a computably presented metric structure ⋮ Effectively infinite classes of numberings of computable families of reals ⋮ Extremal numberings and fixed point theorems ⋮ ON COHESIVE POWERS OF LINEAR ORDERS ⋮ MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY ⋮ ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS ⋮ CHAITIN’S Ω AS A CONTINUOUS FUNCTION ⋮ COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR ⋮ On unstable and unoptimal prediction ⋮ Nonuniformity of downward density in $n$-computably enumerable Turing degrees ⋮ A classification of low c.e. sets and the Ershov hierarchy ⋮ Effectively infinite classes of numberings and computable families of reals ⋮ Isolation from side and cone avoidance in the 2-computably enumerable \textit{wtt}-degrees ⋮ Families of permutations and ideals of Turing degrees ⋮ Direct construction of Scott ideals ⋮ The non-normal abyss in Kleene's computability theory ⋮ Generically Computable abelian groups ⋮ On the order dimension of locally countable partial orderings ⋮ Embeddings between partial combinatory algebras ⋮ On the computational properties of the uncountability of the real numbers ⋮ Computability of graphs ⋮ Lowness for isomorphism, countable ideals, and computable traceability ⋮ On the undecidability and descriptional complexity of synchronized regular expressions ⋮ Embedding of the first nonconstructive ordinal into the Rogers semilattices of families of arithmetic sets ⋮ Arithmetical hierarchy of the Besicovitch-stability of noisy tilings ⋮ Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees ⋮ Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types ⋮ A family with a single minimal but not least numbering ⋮ Orders on computable rings ⋮ As easy as $\mathbb {Q}$: Hilbert’s Tenth Problem for subrings of the rationals and number fields ⋮ Unnamed Item ⋮ Computing sets from all infinite subsets ⋮ Noisy inference and oracles ⋮ Canonical immunity and genericity ⋮ $\Sigma_2$ induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture ⋮ Robust learning with infinite additional information ⋮ Synthesizing noise-tolerant language learners ⋮ A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element ⋮ Ultrafilter spaces on the semilattice of partitions ⋮ Vacillatory and BC learning on noisy data ⋮ Embeddings of $N_5$ and the contiguous degrees ⋮ Hyper-polynomial hierarchies and the polynomial jump ⋮ Learning algebraic structures from text ⋮ Aspects of complexity of probabilistic learning under monotonicity constraints ⋮ A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Naturalness in Mathematics ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Cohesive avoidance and strong reductions ⋮ Spectra of theories and structures ⋮ Computable categoricity for algebraic fields with splitting algorithms ⋮ Categoricity properties for computable algebraic fields ⋮ A packed Ramsey’s theorem and computability theory ⋮ Measures and their random reals ⋮ WEIHRAUCH GOES BROUWERIAN ⋮ Degrees of sets having no subsets of higher m- and t t-degree ⋮ Point Degree Spectra of Represented Spaces ⋮ Effectivizing Lusin’s Theorem ⋮ Lawvere-Tierney topologies for computability theorists ⋮ Computational depth and reducibility ⋮ Duality, non-standard elements, and dynamic properties of r.e. sets ⋮ Effectively categorical abelian groups ⋮ Effectivity questions for Kleene's recursion theorem ⋮ Initial segment complexities of randomness notions ⋮ Invertible classes ⋮ Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ Results on memory-limited U-shaped learning ⋮ Covering the Recursive Sets ⋮ Rice’s Theorem in Effectively Enumerable Topological Spaces ⋮ Degrees containing members of thin Π10 classes are dense and co-dense ⋮ Minimal generalized computable enumerations and high degrees ⋮ On images of partial computable functions over computable Polish spaces ⋮ Boolean algebras realized by c.e. equivalence relations ⋮ Learning theory in the arithmetic hierarchy. II. ⋮ AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES ⋮ Orders on magmas and computability theory ⋮ Computable isomorphisms for certain classes of infinite graphs ⋮ On existential definitions of c.e. subsets of rings of functions of characteristic 0 ⋮ Uniformly computably separable algebras with effectively splittable families of negative congruences ⋮ The Hilbert's-tenth-problem operator ⋮ The computational strength of matchings in countable graphs ⋮ Computability of validity and satisfiability in probability logics over finite and countable models

This page was built for publication: