The following pages link to (Q4040892):
Displaying 50 items.
- Lattice nonembeddings and initial segments of the recursively enumerable degrees (Q757358) (← links)
- Effective domination and the bounded jump (Q778723) (← links)
- Finite sets and infinite sets in weak intuitionistic arithmetic (Q781509) (← links)
- The noneffectivity of Arslanov's completeness criterion and related theorems (Q781514) (← links)
- Three concepts of decidability for general subsets of uncountable spaces (Q817852) (← links)
- Divergence bounded computable real numbers (Q817855) (← links)
- New degree spectra of Polish spaces (Q820494) (← links)
- Randomness and universal machines (Q864423) (← links)
- A sequentially computable function that is not effectively continuous at any point (Q864424) (← links)
- Finding domatic partitions in infinite graphs (Q888598) (← links)
- Theory of interaction (Q896903) (← links)
- Reducibilities among equivalence relations induced by recursively enumerable structures (Q896924) (← links)
- \(A\)-computable graphs (Q904145) (← links)
- Honest polynomial time reducibilities and the \(P=?NP\) problem (Q909455) (← links)
- Some notes on Church's thesis and the theory of games (Q911776) (← links)
- On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case (Q922525) (← links)
- On Lachlan's major sub-degree problem (Q943340) (← links)
- A class of \(\Sigma_{3}^{0}\) modular lattices embeddable as principal filters in \({\mathcal L}^*(V_\infty)\) (Q948910) (← links)
- The upward closure of a perfect thin class (Q958485) (← links)
- Challenging epistemology: Interactive proofs and zero knowledge (Q959048) (← links)
- Turing degrees of reals of positive effective packing dimension (Q975475) (← links)
- On some open problems in reflective inductive inference (Q976076) (← links)
- Degree spectra of the successor relation of computable linear orderings (Q1005920) (← links)
- Prescribed learning of r.e. classes (Q1017658) (← links)
- Effective categoricity of abelian \(p\)-groups (Q1023056) (← links)
- The structure of the s-degrees contained within a single e-degree (Q1024548) (← links)
- Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
- The Nakamura numbers for computable simple games (Q1038709) (← links)
- Intervals and sublattices of the r.e. weak truth table degrees. II: Nonbounding (Q1092897) (← links)
- A non-inversion theorem for the jump operator (Q1111549) (← links)
- On the relative sizes of learnable sets (Q1128667) (← links)
- Infima in the recursively enumerable weak truth table degrees (Q1130238) (← links)
- The Mapmaker's dilemma (Q1182308) (← links)
- The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory (Q1193873) (← links)
- Diagonalization, uniformity, and fixed-point theorems (Q1201287) (← links)
- Countable thin \(\Pi^0_1\) classes (Q1208080) (← links)
- The possible Turing degree of the nonzero member in a two element degree spectrum (Q1210135) (← links)
- Degrees of convex dependence in recursively enumerable vector spaces (Q1210136) (← links)
- Weakly semirecursive sets and r.e. orderings (Q1210140) (← links)
- Every recursive Boolean algebra is isomorphic to one with incomplete atoms (Q1210349) (← links)
- Some effectively infinite classes of enumerations (Q1210351) (← links)
- Computable Kripke models and intermediate logics (Q1271561) (← links)
- Relatively recursive reals and real functions (Q1274809) (← links)
- Index sets in computable analysis (Q1292400) (← links)
- Branching in the enumeration degrees of the \(\Sigma_2^0\) sets (Q1293973) (← links)
- Decidable Kripke models of intuitionistic theories (Q1295382) (← links)
- Index sets for \(\Pi^0_1\) classes (Q1295386) (← links)
- Definable properties of the computably enumerable sets (Q1295410) (← links)
- Computably enumerable sets and quasi-reducibility (Q1295419) (← links)
- Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete (Q1305933) (← links)
