The following pages link to (Q3819052):
Displaying 50 items.
- Orbits of maximal vector spaces (Q282117) (← links)
- A note on the enumeration degrees of 1-generic sets (Q283105) (← links)
- Reverse mathematics, well-quasi-orders, and Noetherian spaces (Q283113) (← links)
- Computable dimension for ordered fields (Q283123) (← links)
- Degrees that are not degrees of categoricity (Q306834) (← links)
- On the strength of the finite intersection principle (Q375889) (← links)
- Almost universal cupping and diamond embeddings (Q408168) (← links)
- Computable fields and the bounded Turing reduction (Q408170) (← links)
- Badness and jump inversion in the enumeration degrees (Q412060) (← links)
- Effectively approximating measurable sets by open sets (Q418744) (← links)
- Initial segments of computable linear orders with additional computable predicates (Q431706) (← links)
- \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs (Q436224) (← links)
- \(Q _{1}\)-degrees of c.e. sets (Q453193) (← links)
- On arithmetical level of the class of superhigh sets (Q465108) (← links)
- Definable relations in Turing degree structures (Q468086) (← links)
- A DNC function that computes no effectively bi-immune set (Q494640) (← links)
- Computing planarity in computable planar graphs (Q503647) (← links)
- The strength of the Grätzer-Schmidt theorem (Q506962) (← links)
- Random numbers as probabilities of machine behavior (Q524278) (← links)
- Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522) (← links)
- Embedding and coding below a 1-generic degree (Q558421) (← links)
- Application of precomplete enumerations to tabular-type degrees and index sets (Q583199) (← links)
- Completeness in the arithmetical hierarchy and fixed points (Q583200) (← links)
- Working below a \(low_ 2\) recursively enumerable degree (Q584251) (← links)
- Linear orderings of low degree (Q610306) (← links)
- A superhigh diamond in the c.e. tt-degrees (Q627429) (← links)
- Extending and interpreting Post's programme (Q636317) (← links)
- A measure-theoretic proof of Turing incomparability (Q638476) (← links)
- \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures (Q639658) (← links)
- The complexity of central series in nilpotent computable groups (Q639669) (← links)
- The Friedman embedding theorem. (Q645257) (← links)
- On a computable presentation of low linear orderings (Q669557) (← links)
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra (Q673778) (← links)
- Automorphisms in the PTIME-Turing degrees of recursive sets (Q676317) (← links)
- Friedberg splittings of recursively enumerable sets (Q685058) (← links)
- Undecidability and 1-types in the recursively enumerable degrees (Q688787) (← links)
- The distribution of the generic recursively enumerable degrees (Q688848) (← links)
- Automata theory based on complete residuated lattice-valued logic: Turing machines (Q690917) (← links)
- How powerful are integer-valued martingales? (Q693070) (← links)
- Strongly \(\eta \)-representable degrees and limitwise monotonic functions (Q695785) (← links)
- The minimal e-degree problem in fragments of Peano arithmetic (Q705537) (← links)
- Index sets and universal numberings (Q716308) (← links)
- Complexity of the isomorphism problem for computable free projective planes of finite rank (Q721371) (← links)
- Constructive dimension and Turing degrees (Q733739) (← links)
- Enumerations and completely decomposable torsion-free abelian groups (Q733745) (← links)
- A theorem on strongly \(\eta \)-representable sets (Q735995) (← links)
- Model-theoretic properties of Turing degrees in the Ershov difference hierarchy (Q744306) (← links)
- Some applications of computable one-one numberings (Q750430) (← links)
- Cook reducibility is faster than Karp reducibility in NP (Q751812) (← links)
- Determining and stationary sets for some classes of partial recursive functions (Q757357) (← links)
