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)
- Computing sets from all infinite subsets
- Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete
- Small \(\Pi^{0}_{1}\) classes
- Honest polynomial time reducibilities and the \(P=?NP\) problem
- Irreducible, singular, and contiguous degrees
- Generic degrees are complemented
- Undecidability and 1-types in the recursively enumerable degrees
- Index sets for \(\Pi^0_1\) classes
- The ibT degrees of computably enumerable sets are not dense
- On \(\Pi_ 2\) theories of \(hp-T\) degrees of low sets
- A semilattice of numberings. II
- A non-inversion theorem for the jump operator
- \(sQ_1\)-degrees of computably enumerable sets
- Computable presentability of countable linear orders
- Limit computability and ultrafilters
- Computably enumerable Turing degrees and the meet property
- Decidable Kripke models of intuitionistic theories
- Lower bounds and the hardness of counting properties
- Dependence relations in computably rigid computable vector spaces
- Countable thin \(\Pi^0_1\) classes
- Coding in the partial order of enumerable sets
- On the classification of computable languages
- The recursively enumerable degrees have infinitely many one-types
- There is no fat orbit
- The weak density of properly d-r. e. branching degree in the d-r. e. degrees
- Turing degrees in refinements of the arithmetical hierarchy
- Covering the Recursive Sets
- A uniform version of non-\(\mathrm{low}_{2}\)-ness
- Input-dependence in function-learning
- On isomorphism classes of computably enumerable equivalence relations
- Learning all subfunctions of a function
- Classes with easily learnable subclasses
- Atomless \(r\)-maximal sets
- Fixed-point selection functions
- A class of reversible primitive recursive functions
- Undecidability in Rn: Riddled Basins, the KAM Tori, and the Stability of the Solar System
- The irrationality exponents of computable numbers
- Computability and the Implicit Function Theorem
- Computational processes, observers and Turing incompleteness
- Embeddings of \(N_5\) and the contiguous degrees
- Descriptive properties on admissible sets
- Non-bounding constructions
- Lattice nonembeddings and initial segments of the recursively enumerable degrees
- Turing degrees of reals of positive effective packing dimension
- Degree spectra of the successor relation of computable linear orderings
- 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
- Effective domination and the bounded jump
- Incomparable prime ideals of recursively enumerable degrees
- On relative randomness
- Investigations concerning the structure of complete sets
- Finite sets and infinite sets in weak intuitionistic arithmetic
- The noneffectivity of Arslanov's completeness criterion and related theorems
- A note on algebras of languages
- Ultrafilter spaces on the semilattice of partitions
- Anomalous learning helps succinctness
- The structure of the s-degrees contained within a single e-degree
- Divergence bounded computable real numbers
- Three concepts of decidability for general subsets of uncountable spaces
- Theory of interaction
- A learning-theoretic characterization of classes of recursive functions
- If not empty, NP-P is topologically large
- Generically and coarsely computable isomorphisms
- Embeddings between 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
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)
