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)

Turing degrees of reals of positive effective packing dimension
Honest polynomial time reducibilities and the \(P=?NP\) problem
Computably enumerable Turing degrees and the meet property
Atomless \(r\)-maximal sets
Theory of interaction
Undecidability in Rⁿ: Riddled Basins, the KAM Tori, and the Stability of the Solar System
The structure of the s-degrees contained within a single e-degree
Effective domination and the bounded jump
Covering the Recursive Sets
Countable thin \(\Pi^0_1\) classes
Descriptive properties on admissible sets
The irrationality exponents of computable numbers
Computing sets from all infinite subsets
Non-bounding constructions
Finite sets and infinite sets in weak intuitionistic arithmetic
The noneffectivity of Arslanov's completeness criterion and related theorems
Incomparable prime ideals of recursively enumerable degrees
On relative randomness
Coding in the partial order of enumerable sets
The ibT degrees of computably enumerable sets are not dense
Lattice nonembeddings and initial segments of the recursively enumerable degrees
A learning-theoretic characterization of classes of recursive functions
On the classification of computable languages
Computational processes, observers and Turing incompleteness
A class of reversible primitive recursive functions
A non-inversion theorem for the jump operator
Computability and the Implicit Function Theorem
Divergence bounded computable real numbers
Three concepts of decidability for general subsets of uncountable spaces
Irreducible, singular, and contiguous degrees
Generic degrees are complemented
If not empty, NP-P is topologically large
Undecidability and 1-types in the recursively enumerable degrees
Generically and coarsely computable isomorphisms
Anomalous learning helps succinctness
Ultrafilter spaces on the semilattice of partitions
Decidable Kripke models of intuitionistic theories
\(sQ_1\)-degrees of computably enumerable sets
A uniform version of non-\(\mathrm{low}_{2}\)-ness
Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete
There is no fat orbit
Input-dependence in function-learning
Turing degrees in refinements of the arithmetical hierarchy
Fixed-point selection functions
Small \(\Pi^{0}_{1}\) classes
On \(\Pi_ 2\) theories of \(hp-T\) degrees of low sets
Index sets for \(\Pi^0_1\) classes
Embeddings between partial combinatory algebras
Investigations concerning the structure of complete sets
A semilattice of numberings. II
Computable presentability of countable linear orders
Lower bounds and the hardness of counting properties
Dependence relations in computably rigid computable vector spaces
Embeddings of \(N_5\) and the contiguous degrees
A note on algebras of languages
On isomorphism classes of computably enumerable equivalence relations
Degree spectra of the successor relation of computable linear orderings
The recursively enumerable degrees have infinitely many one-types
Limit computability and ultrafilters
The weak density of properly d-r. e. branching degree in the d-r. e. degrees
Martin's axiom and embeddings of upper semi-lattices into the Turing degrees
The computable Lipschitz degrees of computably enumerable sets are not dense
Maximal pairs of c.e. reals in the computably Lipschitz degrees
Learning all subfunctions of a function
Classes with easily learnable subclasses
The Nakamura numbers for computable simple games
Strong reductions in effective randomness
Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
Completing pseudojump operators
Cousin’s lemma in second-order arithmetic
The Kolmogorov complexity of random reals
Nonanonymity and sensitivity of computable simple games
A class of \(\Sigma_{3}^{0}\) modular lattices embeddable as principal filters in \({\mathcal L}^*(V_\infty)\)
The complexity of computable categoricity
The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
Computable linear orders and the Ershov hierarchy
Characterizing strong randomness via Martin-Löf randomness
Computing power of Turing machines in the framework of unsharp quantum logic
Randomness and universal machines
scientific article; zbMATH DE number 3861137 (Why is no real title available?)
Infinite dimensional proper subspaces of computable vector spaces
Weak density and cupping in the d-r.e. degrees
On \(n\)-tardy sets
Reducibility on families
Every recursive Boolean algebra is isomorphic to one with incomplete atoms
Effective categoricity of equivalence structures
Effectively categorical abelian groups
The computability, definability, and proof theory of Artinian rings
Measures and their random reals
Prescribed learning of r.e. classes
The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory
Spaces of orders and their Turing degree spectra
Reverse mathematics and order theoretic fixed point theorems
scientific article; zbMATH DE number 4057497 (Why is no real title available?)
Integer valued betting strategies and Turing degrees
The computational strength of matchings in countable graphs
Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes
Full abstraction for PCF
Some notes on Church's thesis and the theory of games
Techniques of admissible recursion theory

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)