The following pages link to (Q3819052):
Displayed 50 items.
- The dimensions of individual strings and sequences (Q1887139) (← links)
- Counting extensional differences in BC-learning (Q1887167) (← links)
- Infimum properties differ in the weak truth-table degrees and the Turing degrees (Q1888712) (← links)
- Interpreting true arithmetic in the theory of the r.e. truth table degrees (Q1902619) (← links)
- Undecidable fragments of elementary theories (Q1906521) (← links)
- Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree (Q1916896) (← links)
- Interpolating \(d\)-r.e. and REA degrees between r.e. degrees (Q1919759) (← links)
- Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma (Q1919765) (← links)
- Effective inseparability in a topological setting (Q1923565) (← links)
- Priority constructions (Q1923576) (← links)
- A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs (Q1926591) (← links)
- Effective algebraicity (Q1935364) (← links)
- Finitely presented expansions of computably enumerable semigroups (Q1936272) (← links)
- Effective randomness of unions and intersections (Q1946502) (← links)
- Maximal pairs of computably enumerable sets in the computably Lipschitz degrees (Q1946505) (← links)
- Degrees of categoricity and the hyperarithmetic hierarchy (Q1949167) (← links)
- Isolated 2-computably enumerable \(Q\)-degrees (Q1956598) (← links)
- Strong noncuppability in low computably enumerable degrees (Q1956608) (← links)
- Simple structures with complex symmetry (Q1957352) (← links)
- Arrow's theorem, countably many agents, and more visible invisible dictators (Q1961954) (← links)
- Some reducibilities and splittings of recursively enumerable sets (Q1972524) (← links)
- Algorithmic randomness and Fourier analysis (Q2000003) (← links)
- Outline of partial computability in computable topology (Q2011636) (← links)
- On higher effective descriptive set theory (Q2011663) (← links)
- Between Turing and Kleene (Q2151416) (← links)
- On mutual definability of operations on fields (Q2186309) (← links)
- Classifying equivalence relations in the Ershov hierarchy (Q2204368) (← links)
- Minimal equivalence relations in hyperarithmetical and analytical hierarchies (Q2207013) (← links)
- Combinatorial principles between \(\text{RRT}_2^2\) and \(\text{RT}_2^2\) (Q2258112) (← links)
- Scattered linear orderings with no computable presentation (Q2263069) (← links)
- Limitwise monotonic functions relative to the Kleene's ordinal notation system (Q2263107) (← links)
- Codings on linear orders and algorithmic independence of natural relations (Q2263111) (← links)
- On computably enumerable structures (Q2263114) (← links)
- Joining to high degrees via noncuppables (Q2267747) (← links)
- The limitations of cupping in the local structure of the enumeration degrees (Q2267755) (← links)
- On computational complexity and honest polynomial degrees (Q2277252) (← links)
- R.e. Prime powers and total rigidity (Q2281321) (← links)
- Partial decidable presentations in hyperarithmetic (Q2332068) (← links)
- Unified characterizations of lowness properties via Kolmogorov complexity (Q2339957) (← links)
- Abelian \(p\)-groups and autostability relative to an oracle (Q2342098) (← links)
- Computability-theoretic properties of injection structures (Q2342300) (← links)
- \(\Sigma_{2}^{0}\)-initial segments of computable linear orders (Q2342318) (← links)
- \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets (Q2352682) (← links)
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders (Q2360265) (← links)
- Embeddability of the semilattice \(L_m^0\) in Rogers semilattices (Q2364326) (← links)
- Semantic universality of theories over a superlist (Q2366359) (← links)
- On definable filters in computably enumerable degrees (Q2370372) (← links)
- Computable linearizations of well-partial-orderings (Q2385530) (← links)
- Bounded low and high sets (Q2402957) (← links)
- Complements for enumeration \(\Pi_1^0\)-degrees (Q2436108) (← links)