Turing Incomparability in Scott Sets

Simple item page
dc.creatorKucera, Antonin
dc.creatorSlaman, Theodore A.
dc.date2006-02-20
dc.date2006-08-13
dc.date.accessioned2026-07-07T07:03:37Z
dc.date.available2026-07-07T07:03:37Z
dc.descriptionFor every Scott set F and every nonrecursive set X in F, there is a Y in F such that X and Y are Turing incomparable.
dc.identifierhttps://arxiv.org/abs/math/0602439
dc.identifierhttp://arxiv.org/abs/math/0602439
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/109039
dc.subjectLogic
dc.subject03D28
dc.titleTuring Incomparability in Scott Sets
dc.typetext

Files

Collections

arXiv