scientific article; zbMATH DE number 194103
From MaRDI portal
Publication:4040892
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)
Recommendations
Cited in
(only showing first 100 items - show all)- Degree spectra of the successor relation of computable linear orderings
- Prescribed learning of r.e. classes
- Effective categoricity of abelian p-groups
- The structure of the s-degrees contained within a single e-degree
- Turing oracle machines, online computing, and three displacements in computability theory
- The Nakamura numbers for computable simple games
- Techniques of admissible recursion theory
- Intervals and sublattices of the r.e. weak truth table degrees. II: Nonbounding
- A non-inversion theorem for the jump operator
- On the relative sizes of learnable sets
- Infima in the recursively enumerable weak truth table degrees
- The Mapmaker's dilemma
- The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory
- Diagonalization, uniformity, and fixed-point theorems
- Countable thin ^0_1 classes
- The possible Turing degree of the nonzero member in a two element degree spectrum
- Degrees of convex dependence in recursively enumerable vector spaces
- Weakly semirecursive sets and r.e. orderings
- Every recursive Boolean algebra is isomorphic to one with incomplete atoms
- Some effectively infinite classes of enumerations
- Computable Kripke models and intermediate logics
- Relatively recursive reals and real functions
- Index sets in computable analysis
- Branching in the enumeration degrees of the _2⁰ sets
- Decidable Kripke models of intuitionistic theories
- Index sets for ^0_1 classes
- Definable properties of the computably enumerable sets
- Computably enumerable sets and quasi-reducibility
- Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete
- Classical recursion theory. Vol. II
- On \(\Pi_ 2\) theories of \(hp-T\) degrees of low sets
- Quasi-injective reductions
- The continuity of cupping to \(\text \textbf{0}'\)
- A rank one cohesive set
- The polynomially exponential time restrained analytical hierarchy
- Index sets and presentations of complexity classes
- Minimal pairs in initial segments of the recursively enumerable degrees
- Boolean pairs formed by the \(\Delta_ n^ 0\)-sets
- A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
- Coding in the partial order of enumerable sets
- Noisy inference and oracles
- Turing degrees of hypersimple relations on computable structures
- Cellular automata and intermediate degrees.
- Random elements in effective topological spaces with measure.
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings
- Complementing cappable degrees in the difference hierarchy.
- Undecidability results for low complexity time classes
- Resolution of Hartmanis' conjecture for NL-hard sparse sets
- Undecidability and 1-types in intervals of the computably enumerable degrees
- Classes bounded by incomplete sets
- The closure properties on real numbers under limits and computable operators.
- Degree spectra and computable dimensions in algebraic structures
- Degree spectra of relations on structures of finite computable dimension
- Positive presentations of families relative to e-oracles
- The computability, definability, and proof theory of Artinian rings
- Lowness and logical depth
- Schnorr randomness for noncomputable measures
- Typing total recursive functions in Coq
- Computable torsion abelian groups
- Jumps of computably enumerable equivalence relations
- Universal generalized computable numberings and hyperimmunity
- Recursion-theoretic ranking and compression
- Positive presentations of families in relation to reducibility with respect to enumerability
- Degree spectra of real closed fields
- Computable linear orders and the Ershov hierarchy
- Turing degrees in refinements of the arithmetical hierarchy
- Strong reductions in effective randomness
- Nonanonymity and sensitivity of computable simple games
- The recursively enumerable degrees have infinitely many one-types
- Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees
- Some orbits for \({\mathcal E}\)
- Nonisolated degrees and the jump operator
- Orbits of computably enumerable sets: Low sets can avoid an upper cone
- The complexity of universal text-learners.
- Full abstraction for PCF
- Degrees of Dowd-type generic oracles
- Entropic measures, Markov information sources and complexity
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- Refuting learning revisited.
- On algebraic and logical specifications of classes of regular languages.
- Trees and learning
- The complexity of reversible cellular automata
- On Kurtz randomness
- The Kolmogorov complexity of random reals
- The bounded injury priority method and the learnability of unions of rectangles
- There is no fat orbit
- Diagonalization in double frames
- A specification structure for deadlock-freedom of synchronous processes
- Atomless r-maximal sets
- The weak density of properly d-r. e. branching degree in the d-r. e. degrees
- A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees
- A class of recursive permutations which is primitive recursive complete
- Separable enumerations of division rings and effective embeddability of rings therein
- Fixed-point selection functions
- Absolute and relative properties of negatively numbered families
- Computable metrics above the standard real metric
- Turing computability: structural theory
- Categoricity spectra of computable structures
- Computable linear orders and limitwise monotonic functions
- Precomplete numberings
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)
