The following pages link to (Q4249724):
Displaying 49 items.
- Primitive recursion and the chain antichain principle (Q435242) (← links)
- Algebraic structures computable without delay (Q528478) (← links)
- Linear orderings of low degree (Q610306) (← links)
- On a computable presentation of low linear orderings (Q669557) (← links)
- Strongly \(\eta \)-representable degrees and limitwise monotonic functions (Q695785) (← links)
- A theorem on strongly \(\eta \)-representable sets (Q735995) (← links)
- On a possible continuous analogue of the Szpilrajn theorem and its strengthening by Dushnik and Miller (Q878146) (← links)
- Computable shuffle sums of ordinals (Q938232) (← links)
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings (Q1425651) (← links)
- Degree spectra of relations on structures of finite computable dimension (Q1612487) (← links)
- \(\Pi_{1}^{0}\) classes and orderable groups (Q1612488) (← links)
- Conditional extensions of fuzzy preorders (Q1677010) (← links)
- The Kierstead's conjecture and limitwise monotonic functions (Q1709678) (← links)
- Computability of distributive lattices (Q1745078) (← links)
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings (Q1861536) (← links)
- Punctual dimension of algebraic structures in certain classes (Q2030135) (← links)
- Categoricity spectra of computable structures (Q2036466) (← links)
- Computable linear orders and limitwise monotonic functions (Q2036468) (← links)
- Degree spectra of structures (Q2036471) (← links)
- Codings on linear orders and algorithmic independence of natural relations (Q2263111) (← links)
- Categorical linearly ordered structures (Q2311213) (← links)
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders (Q2360265) (← links)
- Degrees of autostability for linear orders and linearly ordered abelian groups (Q2364330) (← links)
- Equivalence between Fraïssé's conjecture and Jullien's theorem (Q2368905) (← links)
- Effectively categorical abelian groups (Q2377433) (← links)
- Computable linearizations of well-partial-orderings (Q2385530) (← links)
- The uniform content of partial and linear orders (Q2400498) (← links)
- On self-embeddings of computable linear orderings (Q2576940) (← links)
- Prime models of theories of computable linear orderings (Q2723507) (← links)
- Weak presentations of computable partial orderings (Q2784777) (← links)
- Herrmann’s Beautiful Theorem on Computable Partial Orderings (Q2970954) (← links)
- A Note on Effective Categoricity for Linear Orderings (Q2988812) (← links)
- Computable completely decomposable groups (Q3190417) (← links)
- The computability path ordering (Q3196359) (← links)
- The Reverse Mathematics of wqos and bqos (Q3295152) (← links)
- Increasing <i>η</i> -representable degrees (Q3650322) (← links)
- On computable self-embeddings of computable linear orderings (Q3655260) (← links)
- Torsion-free abelian groups with optimal Scott families (Q4565755) (← links)
- A Friedberg enumeration of equivalence structures (Q4596664) (← links)
- Embedding jump upper semilattices into the Turing degrees (Q4650267) (← links)
- Computable topological groups and Pontryagin duality (Q4691089) (← links)
- COMPUTABLE LINEAR ORDERS AND PRODUCTS (Q5148100) (← links)
- CODING IN GRAPHS AND LINEAR ORDERINGS (Q5148104) (← links)
- FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS (Q5159502) (← links)
- On Kierstead’s conjecture (Q5227998) (← links)
- An undecidable linear order that is \(n\)-decidable for all \(n\) (Q5937834) (← links)
- A class of low linear orders having computable presentations (Q6072990) (← links)
- THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES (Q6123581) (← links)
- Embeddings into left‐orderable simple groups (Q6134473) (← links)
