scientific article; zbMATH DE number 194103

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

Recommendations

scientific article; zbMATH DE number 4091484
scientific article; zbMATH DE number 4057497
Classical recursion theory. Vol. II
Techniques of admissible recursion theory
Classical recursion theory. The theory of functions and sets of natural numbers

Cited in

(only showing first 100 items - show all)

The upward closure of a perfect thin class
Spaces of orders and their Turing degree spectra
New degree spectra of Polish spaces
Generically and coarsely computable isomorphisms
A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees
Orbits of computably enumerable sets: Low sets can avoid an upper cone
Enumerations of ^0_1 classes: acceptability and decidable classes
On fairly low and superlow sets
The continuity of cupping to \(\text \textbf{0}'\)
Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
The complexity of universal text-learners.
Embeddings between partial combinatory algebras
Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete
As easy as \(\mathbb {Q}\): Hilbert's tenth problem for subrings of the rationals and number fields
Intervals and sublattices of the r.e. weak truth table degrees. II: Nonbounding
Degree spectra and computable dimensions in algebraic structures
Undecidability and 1-types in intervals of the computably enumerable degrees
Small \(\Pi^{0}_{1}\) classes
Randomness and initial segment complexity for measures
Computing sets from all infinite subsets
Honest polynomial time reducibilities and the \(P=?NP\) problem
AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
Arithmetical hierarchy of the Besicovitch-stability of noisy tilings
Infima in the recursively enumerable weak truth table degrees
Random reals as measures of natural open sets
Computing constraint sets for differential fields
Infinite and bi-infinite words with decidable monadic theories
Irreducible, singular, and contiguous degrees
Generic degrees are complemented
Undecidability and 1-types in the recursively enumerable degrees
scientific article; zbMATH DE number 7091966 (Why is no real title available?)
Downward density of exact degrees
Absolute and relative properties of negatively numbered families
Elementary differences between the degrees of unsolvability and degrees of compressibility
Index sets for ^0_1 classes
Challenging epistemology: Interactive proofs and zero knowledge
On trees without hyperimmune branches
Non-coding enumeration operators
Randomness and universal machines
Turing degrees and automorphism groups of substructure lattices
A class of recursive permutations which is primitive recursive complete
On infinite direct sums of minimal numberings of functional families
Any FIP real computes a 1-generic
Minimal pairs in initial segments of the recursively enumerable degrees
Classes bounded by incomplete sets
Noisy inference and oracles
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms
Rogers semilattices for families of equivalence relations in the Ershov hierarchy
Coding true arithmetic in the Medvedev degrees of ^0_1 classes
Lawvere-Tierney topologies for computability theorists
On the order dimension of locally countable partial orderings
Integer valued betting strategies and Turing degrees
The ibT degrees of computably enumerable sets are not dense
A semilattice of numberings. II
Continuity theorems for a class of computable operators
Defining algorithmically presented structures in first order logic
The computational strength of matchings in countable graphs
On \(\Pi_ 2\) theories of \(hp-T\) degrees of low sets
Cohesive powers of structures
On computable numberings of families of Turing degrees
On effective convergence in Fekete's lemma and related combinatorial problems in information theory
Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
Every recursive Boolean algebra is isomorphic to one with incomplete atoms
Degrees of Dowd-type generic oracles
\textit{CEA}-operators and the Ershov hierarchy. I
A non-inversion theorem for the jump operator
On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case
Effectivizing Lusin’s Theorem
Representations and the foundations of mathematics
Embedding of the first nonconstructive ordinal into the Rogers semilattices of families of arithmetic sets
The bounded injury priority method and the learnability of unions of rectangles
When Is Reachability Intrinsically Decidable?
Computable classifications of continuous, transducer, and regular functions
The Hilbert's-tenth-problem operator
Computable presentability of countable linear orders
sQ₁-degrees of computably enumerable sets
Separable enumerations of division rings and effective embeddability of rings therein
A survey of results on the d.c.e. and \(n\)-c.e. degrees
Limitwise monotonic spectra and their generalizations
On the degrees of constructively immune sets
On some open problems in reflective inductive inference
Computably enumerable Turing degrees and the meet property
Isolation from side in 2-computably enumerable degrees
Decidable Kripke models of intuitionistic theories
Relativized depth
Lower bounds and the hardness of counting properties
Dependence relations in computably rigid computable vector spaces
Measure-theoretic applications of higher Demuth's theorem
A specification structure for deadlock-freedom of synchronous processes
Limit computability and ultrafilters
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
Generically Computable abelian groups
The non-normal abyss in Kleene's computability theory
Lowness for isomorphism, countable ideals, and computable traceability
The Nakamura numbers for computable simple games
Trees and learning
Effective categoricity of automatic equivalence and nested equivalence structures

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040892)