Pages that link to "Item:Q2655143"
From MaRDI portal
The following pages link to Degrees of categoricity of computable structures (Q2655143):
Displaying 19 items.
- A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS (Q4638989) (← links)
- (Q4779146) (← links)
- Computable categoricity versus relative computable categoricity (Q4921488) (← links)
- Coding in the automorphism group of a computably categorical structure (Q4988826) (← links)
- Degrees of bi-embeddable categoricity (Q4995600) (← links)
- Relativizing computable categoricity (Q5002563) (← links)
- Every Δ20 degree is a strong degree of categoricity (Q5055316) (← links)
- Degrees of categoricity of trees and the isomorphism problem (Q5108865) (← links)
- Degrees of and lowness for isometric isomorphism (Q5145850) (← links)
- Decompositions of decidable abelian groups (Q5216188) (← links)
- Computable categoricity for algebraic fields with splitting algorithms (Q5246987) (← links)
- DEGREES OF CATEGORICITY ON A CONE VIA<i>η</i>-SYSTEMS (Q5738206) (← links)
- 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms (Q5741344) (← links)
- Computing on the Banach space C [ 0 , 1 ] (Q5859846) (← links)
- Categoricity spectra for rigid structures (Q5963198) (← links)
- The theory of projective planes is complete with respect to degree spectra and effective dimensions (Q5965134) (← links)
- Effective categoricity of computable linear orderings (Q5965136) (← links)
- Decidable categoricity spectra for almost prime models (Q6597843) (← links)
- Degrees of categoricity and treeable degrees (Q6649852) (← links)