528 search results - page 3 / 106 » Degrees of categoricity of computable structures |
STACS
2005
Springer
14 years 28 days ago
2005
Springer
ded abstract of this article is published in the proceedings of STACS’05, LNCS 3404, Springer Verlag. A relational structure is a core, if all its endomorphisms are embeddings. T...
CHI
2002
ACM
14 years 7 months ago
2002
ACM
We present experimental results showing that search for target items in a three-tiered categorization structure (approximately 8 links per page) is faster than a comparable two-ti...
JCSS
2007
13 years 7 months ago
2007
We show that the elementary theory of the structure of the Solovay degrees of computably enumerable reals is undecidable.
CIE
2005
Springer
14 years 1 months ago
2005
Springer
Two properties of the Co-Spectrum of the Joint Spectrum tely many abstract structures are presented - a Minimal Pair type theorem and the existence of a Quasi-Minimal degree with r...
CIE
2005
Springer
14 years 1 months ago
2005
Springer
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...