The following pages link to (Q3819052):
Displayed 50 items.
- 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)
- 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)
- 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)
- Complements for enumeration \(\Pi_1^0\)-degrees (Q2436108) (← links)
- A note on \(\Delta_2^0\)-spectra of linear orderings and degree spectra of the successor relation (Q2439398) (← links)
- Modulo computably enumerable degrees by cupping partners (Q2454661) (← links)
- Ideals in computable rings (Q2456205) (← links)
- An explicit solution to Post's problem over the reals (Q2479313) (← links)
- Computability of simple games: A characterization and application to the core (Q2482640) (← links)
- Definability as hypercomputational effect (Q2497876) (← links)
- Bounding computably enumerable degrees in the Ershov hierarchy (Q2498901) (← links)
- Computational power of infinite quantum parallelism (Q2498972) (← links)
- A computably stable structure with no Scott family of finitary formulas (Q2501165) (← links)
- Boolean algebras, Tarski invariants, and index sets (Q2505128) (← links)
- \(\Pi^0_1\)-presentations of algebras (Q2505502) (← links)
- Hypersimplicity and semicomputability in the weak truth table degrees (Q2576639) (← links)
- 1-generic splittings of computably enumerable degrees (Q2576946) (← links)
- On the complexity of radicals in noncommutative rings (Q2655033) (← links)
- The \(\forall \exists \)-theory of the effectively closed Medvedev degrees is decidable (Q2655138) (← links)
- Infima of d.r.e. degrees (Q2655142) (← links)
- Degrees of categoricity of computable structures (Q2655143) (← links)
- Prime models of theories of computable linear orderings (Q2723507) (← links)
- On the structures inside truth-table degrees (Q2747717) (← links)
- Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees (Q2750927) (← links)
- Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem (Q2841359) (← links)
- Measure and cupping in the Turing degrees (Q2845877) (← links)
- The isomorphism problem on classes of automatic structures with transitive relations (Q2847190) (← links)