Q BgQuestion:

      
Mentor
Karma Points: 637
Respect (100%):
posted by  gvousden on 5/17/2009 9:48:10 PM  |  status: Live  |  Earned Karma: 637

Decidable sets

Course Textbook Chapter Problem Needs by
Other Logic for Philosophers N/A N/A N/A
Question Details:
When calling a set A “decidable”, we frequently let the background context supply which superset B ⊇ A that A is decidable with respect to. Awareness of which set B is in question is important, though. Show that there exist subsets A, B, and C of ω such that A is decidable with respect to B, but A is not decidable with respect to C.

For the record, our courses defintion of a 'decidable set' is a set with a computable characteristic function.  If A is a subset of B, the characteristic function of A (with respect to B) is X: B -> {0,1}:

X(b) = 1, if b belongs to A; 0, if otherwise


Lastly, ω is the set of natural numbers.

Bonus Point Alert! Earn +6 additional karma points for helping this gold member.

AAnswers:

Answer Question Ask for clarification

No one has answered this question yet.

Be the first to answer. Earn up to 13 karma points.

Answer Question Ask for clarificarion

Join Cramster's Community

Cramster.com brings together students, educators and subject enthusiasts in an online study community. With around-the-clock expert help and a community of over 100,000 knowledgeable members, you can find the help you need, whenever you need it. Join for free today » How Cramster is different from tutoring »