Degree spectra of relations on structures of finite computable dimension
From MaRDI portal
Publication:1612487
DOI10.1016/S0168-0072(01)00094-XzbMath1016.03035MaRDI QIDQ1612487
Publication date: 22 August 2002
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (5)
Degree spectra and computable dimensions in algebraic structures ⋮ Finite computable dimension and degrees of categoricity ⋮ On the isomorphism problem for some classes of computable algebraic structures ⋮ Freely generated projective planes with finite computable dimension ⋮ The theory of projective planes is complete with respect to degree spectra and effective dimensions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computable single-valued numerations
- Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
- Problem of the number of non-self-equivalent constructivizations
- The possible Turing degree of the nonzero member in a two element degree spectrum
- Handbook of recursive mathematics. Vol. 1: Recursive model theory
- Turing degrees of certain isomorphic images of computable relations
- Computable isomorphisms, degree spectra of relations, and Scott families
- Permitting, forcing, and copying of a given recursive relation
- A solution of the Goncharov-Ash problem and the spectrum problem in the theory of computable models.
- Degree spectra and computable dimensions in algebraic structures
- Degree spectra of intrinsically c.e. relations
- Recursive isomorphism types of recursive Boolean algebras
- Computably categorical structures and expansions by constants
This page was built for publication: Degree spectra of relations on structures of finite computable dimension
