The following pages link to (Q3464657):
Displaying 9 items.
- Computable categoricity for pseudo-exponential fields of \(\aleph_1\) (Q2349103) (← links)
- Computably categorical structures and expansions by constants (Q4254616) (← links)
- UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES (Q4579805) (← links)
- Finding bases of uncountable free abelian groups is usually difficult (Q4608785) (← links)
- COMPLEXITY OF INDEX SETS OF DESCRIPTIVE SET-THEORETIC NOTIONS (Q5100042) (← links)
- COMPUTABILITY IN UNCOUNTABLE BINARY TREES (Q5195058) (← links)
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY (Q5251361) (← links)
- Classes of structures with universe a subset of 1 (Q5406116) (← links)
- Complexity profiles and generic Muchnik reducibility (Q6182774) (← links)