scientific article; zbMATH DE number 194103
From MaRDI portal
Publication:4040892
zbMATH Open0623.03042MaRDI QIDQ4040892FDOQ4040892
Authors: Robert I. Soare 
Publication date: 5 June 1993
Title of this publication is not available (Why is that?)
Recommendations
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)
Cited In (only showing first 100 items - show all)
- A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- Undecidability and 1-types in intervals of the computably enumerable degrees
- Any FIP real computes a 1-generic
- Noisy inference and oracles
- Lawvere-Tierney topologies for computability theorists
- On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms
- Classes bounded by incomplete sets
- Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
- Relativized depth
- A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
- A specification structure for deadlock-freedom of synchronous processes
- Positive presentations of families relative to \(e\)-oracles
- On unstable and unoptimal prediction
- Universal generalized computable numberings and hyperimmunity
- Relatively recursive reals and real functions
- Complementing cappable degrees in the difference hierarchy.
- The closure properties on real numbers under limits and computable operators.
- Initial segments of the degrees of ceers
- Nonisolated degrees and the jump operator
- On algebraic and logical specifications of classes of regular languages.
- Definable properties of the computably enumerable sets
- Minimal generalized computable enumerations and high degrees
- A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
- Turing degrees of hypersimple relations on computable structures
- On cototality and the skip operator in the enumeration degrees
- On the cutting edge of relativization: The resource bounded injury method
- Quasi-injective reductions
- Lowness and logical depth
- A rank one cohesive set
- The polynomially exponential time restrained analytical hierarchy
- Computational depth and reducibility
- COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR
- Completeness criteria for a class of reducibilities
- Schnorr randomness for noncomputable measures
- Typing total recursive functions in Coq
- Computability of validity and satisfiability in probability logics over finite and countable models
- Connected choice and the Brouwer fixed point theorem
- Jumps of computably enumerable equivalence relations
- Boolean pairs formed by the \(\Delta_ n^ 0\)-sets
- Point Degree Spectra of Represented Spaces
- On the algebraic structure of Weihrauch degrees
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- Title not available (Why is that?)
- Resolution of Hartmanis' conjecture for NL-hard sparse sets
- Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees
- Recursion-theoretic ranking and compression
- Computable categoricity for algebraic fields with splitting algorithms
- The theory of ceers computes true arithmetic
- Computability in partial combinatory algebras
- The upward closure of a perfect thin class
- New degree spectra of Polish spaces
- The continuity of cupping to \(\text \textbf{0}'\)
- Randomness and initial segment complexity for measures
- Intervals and sublattices of the r.e. weak truth table degrees. II: Nonbounding
- Infima in the recursively enumerable weak truth table degrees
- Absolute and relative properties of negatively numbered families
- Challenging epistemology: Interactive proofs and zero knowledge
- On the order dimension of locally countable partial orderings
- Minimal pairs in initial segments of the recursively enumerable degrees
- Degrees of Dowd-type generic oracles
- Representations and the foundations of mathematics
- The bounded injury priority method and the learnability of unions of rectangles
- On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case
- A survey of results on the d.c.e. and \(n\)-c.e. degrees
- On some open problems in reflective inductive inference
- C-quasi-minimal enumeration degrees below \(\mathbf c'\)
- Perfect Local Computability and Computable Simulations
- Degree spectra of real closed fields
- Diagonalization in double frames
- Computable metrics above the standard real metric
- Categoricity spectra of computable structures
- Title not available (Why is that?)
- Extremal numberings and fixed point theorems
- Learning algebraic structures from text
- A sequentially computable function that is not effectively continuous at any point
- Computable torsion abelian groups
- On the computational properties of the uncountability of the real numbers
- Index sets in computable analysis
- Categoricity properties for computable algebraic fields
- Reductions between types of numberings
- Rethinking revision
- Finding domatic partitions in infinite graphs
- On \(0'\)-computable reals
- Degree spectra of relations on structures of finite computable dimension
- Refuting learning revisited.
- Spectra of theories and structures
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings
- Reducibilities among equivalence relations induced by recursively enumerable structures
- Undecidability results for low complexity time classes
- Turing oracle machines, online computing, and three displacements in computability theory
- \(A\)-computable graphs
- Computable Kripke models and intermediate logics
- Index sets and presentations of complexity classes
- The Mapmaker's dilemma
- Incomparability in local structures of \(s\)-degrees and \(Q\)-degrees
- Diagonalization, uniformity, and fixed-point theorems
- Synthesizing noise-tolerant language learners
- Ordinal analysis of partial combinatory algebras
- Degree spectra of 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)
