Degree Spectra of Relations on Computable Structures
From MaRDI portal
Publication:4508282
DOI10.2307/421207zbMATH Open0968.03038OpenAlexW2046880643MaRDI QIDQ4508282FDOQ4508282
Authors: Denis R. Hirschfeldt 
Publication date: 11 September 2001
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0602-toc.htm
Recommendations
- Degree spectra of relations on structures of finite computable dimension
- On the spectrum of degrees of decidable relations
- Degree spectra of relations on computable structures in the presence of Δ20isomorphisms
- scientific article; zbMATH DE number 5066582
- scientific article; zbMATH DE number 1904842
- Turing degrees of hypersimple relations on computable structures
- Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
- On the degree structure of equivalence relations under computable reducibility
- Degree spectra and computable dimensions in algebraic structures
- The degree spectra of definable relations on Boolean algebras
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Autostability of models
- Strong and weak constructivization and computable families
- Nilpotent groups of finite algorithmic dimension
- Effective content of field theory
- Problem of the number of non-self-equivalent constructivizations
- The d.r.e. degrees are not dense
- Recursive categoricity and persistence
- Computably categorical structures and expansions by constants
- Computable single-valued numerations
- Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
- The quantity of nonautoequivalent constructivizations
- Some effects of Ash-Nerode and other decidability conditions on degree spectra
- The possible Turing degree of the nonzero member in a two element degree spectrum
- 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
- Relations Intrinsically Recursive in Linear Orders
Cited In (29)
- Spaces of orders and their Turing degree spectra
- Degree spectra and computable dimensions in algebraic structures
- Degree spectra of equivalence relations
- Effective properties of Marker's extensions
- Degree spectra of relations on computable structures in the presence of Δ20isomorphisms
- Relativizing computable categoricity
- Finite computable dimension and degrees of categoricity
- Degree spectra of structures relative to equivalences
- On the spectrum of degrees of decidable relations
- Effective algebraicity
- On degree spectra of topological spaces
- Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
- Degrees of relations on ordinals
- Degree spectra of relations on a cone
- Some effects of Ash-Nerode and other decidability conditions on degree spectra
- Turing degrees of hypersimple relations on computable structures
- Title not available (Why is that?)
- Degree spectra of relations on structures of finite computable dimension
- Title not available (Why is that?)
- A family with a single minimal but not least numbering
- Degree spectra of the successor relation of computable linear orderings
- On the complexity of the successivity relation in computable linear orderings
- Title not available (Why is that?)
- Simple structures with complex symmetry
- On the degree structure of equivalence relations under computable reducibility
- Limitwise monotonic sequences and degree spectra of structures
- Π10 classes and strong degree spectra of relations
- Some elementary degree-theoretic reasons why structures need similarity types
- On \(\Sigma^0_1\)-classification of relations on computable structures
This page was built for publication: Degree Spectra of Relations on Computable Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508282)
