Degree Spectra of Relations on Computable Structures
From MaRDI portal
Publication:4508282
DOI10.2307/421207zbMath0968.03038OpenAlexW2046880643MaRDI QIDQ4508282
Publication date: 11 September 2001
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0602-toc.htm
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (8)
Finite computable dimension and degrees of categoricity ⋮ A family with a single minimal but not least numbering ⋮ Spaces of orders and their Turing degree spectra ⋮ Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures ⋮ Degree Spectra of Relations on a Cone ⋮ Π10 classes and strong degree spectra of relations ⋮ ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS ⋮ Relativizing computable categoricity
Cites Work
- Computable single-valued numerations
- Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
- Autostability of models
- Problem of the number of non-self-equivalent constructivizations
- Some effects of Ash-Nerode and other decidability conditions on degree spectra
- The d.r.e. degrees are not dense
- The possible Turing degree of the nonzero member in a two element degree spectrum
- Strong and weak constructivization and computable families
- The quantity of nonautoequivalent constructivizations
- 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
- Nilpotent groups of finite algorithmic dimension
- Relations Intrinsically Recursive in Linear Orders
- Recursive categoricity and persistence
- Effective content of field theory
- Computably categorical structures and expansions by constants
This page was built for publication: Degree Spectra of Relations on Computable Structures
