The following pages link to Computable Structure Theory (Q5002107):
Displaying 17 items.
- The computable dimension of ordered abelian groups (Q1873769) (← links)
- Learning families of algebraic structures from informant (Q2216113) (← links)
- Generalization of Shapiro's theorem to higher arities and noninjective notations (Q2700823) (← links)
- Definable Subsets of Polynomial-Time Algebraic Structures (Q5042236) (← links)
- DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS (Q5052017) (← links)
- AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS (Q5067872) (← links)
- THE TREE OF TUPLES OF A STRUCTURE (Q5070461) (← links)
- COPYING ONE OF A PAIR OF STRUCTURES (Q5100056) (← links)
- INTERPRETING A FIELD IN ITS HEISENBERG GROUP (Q5100059) (← links)
- ON COHESIVE POWERS OF LINEAR ORDERS (Q6095969) (← links)
- Avoiding Medvedev reductions inside a linear order (Q6096726) (← links)
- Polynomial-time axioms of choice and polynomial-time cardinality (Q6109071) (← links)
- The 𝜔-Vaught’s conjecture (Q6135821) (← links)
- Punctually presented structures I: Closure theorems (Q6146821) (← links)
- Families of permutations and ideals of Turing degrees (Q6148009) (← links)
- Every \(\Delta^0_2\) Polish space is computable topological (Q6554707) (← links)
- On learning down-sets in quasi-orders, and ideals in Boolean algebras (Q6661766) (← links)
