1055 search results - page 1 / 211 » Enumerations in computable structure theory |
JCSS
2007
13 years 5 months ago
2007
We show that the elementary theory of the structure of the Solovay degrees of computably enumerable reals is undecidable.
APAL
2005
13 years 5 months ago
2005
APAL
1998
13 years 5 months ago
1998
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
CIE
2005
Springer
13 years 10 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...
COMBINATORICS
1999
13 years 5 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...