The following pages link to (Q4040892):
Displaying 50 items.
- Downward density of exact degrees (Q266230) (← links)
- Predicativity, the Russell-Myhill paradox, and Church's intensional logic (Q300834) (← links)
- Cohesive sets and rainbows (Q386619) (← links)
- Infinite dimensional proper subspaces of computable vector spaces (Q402446) (← links)
- Computing constraint sets for differential fields (Q402682) (← links)
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma (Q408156) (← links)
- Characterizing strong randomness via Martin-Löf randomness (Q409318) (← links)
- Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes (Q409326) (← links)
- Reducibility on families (Q431669) (← links)
- On \(n\)-tardy sets (Q435200) (← links)
- Comparing Peano arithmetic, Basic Law V, and Hume's Principle (Q450961) (← links)
- The complexity of computable categoricity (Q471691) (← links)
- Computing power of Turing machines in the framework of unsharp quantum logic (Q496026) (← links)
- Proper divisibility in computable rings (Q504325) (← links)
- Covering the recursive sets (Q508828) (← links)
- Computable neighbourhoods of points in semicomputable manifolds (Q508833) (← links)
- Randomness for computable measures and initial segment complexity (Q508835) (← links)
- Transfinite recursion and computation in the iterative conception of set (Q510712) (← links)
- Honest elementary degrees and degrees of relative provability without the cupping property (Q515565) (← links)
- Reverse mathematics and order theoretic fixed point theorems (Q527337) (← links)
- Algebraic structures computable without delay (Q528478) (← links)
- Weak density and cupping in the d-r.e. degrees (Q582288) (← links)
- Learning all subfunctions of a function (Q596299) (← links)
- Classes with easily learnable subclasses (Q598186) (← links)
- On the classification of recursive languages (Q598240) (← links)
- Computational processes, observers and Turing incompleteness (Q616506) (← links)
- Descriptive properties on admissible sets (Q619320) (← links)
- Elementary differences between the degrees of unsolvability and degrees of compressibility (Q636334) (← links)
- Spaces of orders and their Turing degree spectra (Q636350) (← links)
- Martin's axiom and embeddings of upper semi-lattices into the Turing degrees (Q636364) (← links)
- The computable Lipschitz degrees of computably enumerable sets are not dense (Q636391) (← links)
- Maximal pairs of c.e. reals in the computably Lipschitz degrees (Q638499) (← links)
- A note on algebras of languages (Q650885) (← links)
- Anomalous learning helps succinctness (Q671420) (← links)
- P-selectivity: Intersections and indices (Q673115) (← links)
- A learning-theoretic characterization of classes of recursive functions (Q673668) (← links)
- Irreducible, singular, and contiguous degrees (Q683370) (← links)
- Generic degrees are complemented (Q685063) (← links)
- If not empty, NP-P is topologically large (Q688157) (← links)
- Incomparable prime ideals of recursively enumerable degrees (Q688789) (← links)
- On relative randomness (Q688792) (← links)
- A semilattice of numberings. II (Q694202) (← links)
- Computably enumerable sets and related issues (Q695800) (← links)
- Lower bounds and the hardness of counting properties (Q703531) (← links)
- Dependence relations in computably rigid computable vector spaces (Q703839) (← links)
- A uniform version of non-\(\mathrm{low}_{2}\)-ness (Q730092) (← links)
- Input-dependence in function-learning (Q733744) (← links)
- A class of reversible primitive recursive functions (Q737109) (← links)
- Non-bounding constructions (Q750428) (← links)
- Lattice nonembeddings and initial segments of the recursively enumerable degrees (Q757358) (← links)
