Turing incomparability in Scott sets
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F07%3A00004610" target="_blank" >RIV/00216208:11320/07:00004610 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Turing incomparability in Scott sets
Original language description
For 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.
Czech name
Turingovská neporovnatelnost ve Scottových množinách
Czech description
Pro každou Scottovu množinu F a každou nerekurzivní množinu X v F existuje nějaké Y v F takové, že X a Y jsou Turingovsky neporovnatelné.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Proceedings of the American Mathematical Society
ISSN
0002-9939
e-ISSN
—
Volume of the periodical
135
Issue of the periodical within the volume
11
Country of publishing house
US - UNITED STATES
Number of pages
9
Pages from-to
3723-3731
UT code for WoS article
—
EID of the result in the Scopus database
—