Finite computable dimension and degrees of categoricity
From MaRDI portal
Publication:1616772
DOI10.1016/J.APAL.2018.08.012OpenAlexW2885232746WikidataQ129367115 ScholiaQ129367115MaRDI QIDQ1616772
Barbara F. Csima, Jonathan Stephenson
Publication date: 7 November 2018
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2018.08.012
Applications of computability and recursion theory (03D80) Computability and recursion theory (03D99) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (8)
Every Δ20 degree is a strong degree of categoricity ⋮ A structure of punctual dimension two ⋮ On decidable categoricity and almost prime models ⋮ Strong degrees of categoricity and weak density ⋮ DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION ⋮ Categoricity spectra of computable structures ⋮ Degrees of bi-embeddable categoricity of equivalence structures ⋮ Coding in the automorphism group of a computably categorical structure
Cites Work
- Unnamed Item
- Unnamed Item
- Degrees that are not degrees of categoricity
- Problem of the number of non-self-equivalent constructivizations
- The possible Turing degree of the nonzero member in a two element degree spectrum
- Degree spectra of relations on structures of finite computable dimension
- Degrees of categoricity and the hyperarithmetic hierarchy
- Degrees of categoricity of computable structures
- Turing Computability
- Strength and Weakness in Computable Structure Theory
- Computably categorical structures and expansions by constants
- Degree Spectra of Relations on Computable Structures
- DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION
- A computably categorical structure whose expansion by a constant has infinite computable dimension
- DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS
This page was built for publication: Finite computable dimension and degrees of categoricity
