Pages that link to "Item:Q3570169"
From MaRDI portal
The following pages link to A computable ℵ<sub>0</sub>-categorical structure whose theory computes true arithmetic (Q3570169):
Displaying 6 items.
- Constructing decidable graphs from decidable structures (Q2300933) (← links)
- Computing and dominating the Ryll-Nardzewski function (Q2342310) (← links)
- The degrees of categorical theories with recursive models (Q2839320) (← links)
- Enumeration Reducibility and Computable Structure Theory (Q2970965) (← links)
- ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE (Q5107233) (← links)
- CODING IN GRAPHS AND LINEAR ORDERINGS (Q5148104) (← links)