Pages that link to "Item:Q1740457"
From MaRDI portal
The following pages link to Computability-theoretic categoricity and Scott families (Q1740457):
Displaying 21 items.
- The complexity of computable categoricity (Q471691) (← links)
- Degrees of isomorphism types and countably categorical groups (Q661283) (← links)
- The branching theorem and computable categoricity in the Ershov hierarchy (Q887636) (← links)
- Computable categoricity and the Ershov hierarchy (Q958489) (← links)
- Categoricity of computable infinitary theories (Q1005932) (← links)
- Computable isomorphisms, degree spectra of relations, and Scott families (Q1295389) (← links)
- Complexity and categoricity (Q1383162) (← links)
- Structures computable in polynomial time. II (Q1644852) (← links)
- Punctual categoricity relative to a computable oracle (Q2030137) (← links)
- Categoricity spectra of computable structures (Q2036466) (← links)
- On decidable categoricity and almost prime models (Q2203434) (← links)
- Computability-theoretic properties of injection structures (Q2342300) (← links)
- A computably stable structure with no Scott family of finitary formulas (Q2501165) (← links)
- Enumerations in computable structure theory (Q2570135) (← links)
- Computable Scott sentences for quasi-Hopfian finitely presented structures (Q2700812) (← links)
- Exponentiation of Scott formal topologies (Q2851541) (← links)
- Computability of Fraïssé limits (Q3083128) (← links)
- Intrinsic bounds on complexity and definability at limit levels (Q3399191) (← links)
- Computable categoricity versus relative computable categoricity (Q4921488) (← links)
- SCOTT COMPLEXITY OF COUNTABLE STRUCTURES (Q5021936) (← links)
- Two-to-one structures (Q5406114) (← links)
