Computer Science – Logic in Computer Science
Scientific paper
2009-03-12
Mathematical Logic Quarterly, 56(5): 488--502, 2010
Computer Science
Logic in Computer Science
this version of the paper is outdated, please consult the journal version
Scientific paper
10.1002/malq.200910104
Continuous reducibilities are a proven tool in computable analysis, and have
applications in other fields such as constructive mathematics or reverse
mathematics. We study the order-theoretic properties of several variants of the
two most important definitions, and especially introduce suprema for them. The
suprema are shown to commutate with several characteristic numbers.
No associations
LandOfFree
On the (semi)lattices induced by continuous reducibilities does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the (semi)lattices induced by continuous reducibilities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the (semi)lattices induced by continuous reducibilities will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-36602