Strong reducibilities (Q3942949): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Hypersimple sets with retraceable complements / rank
 
Normal rank
Property / cites work
 
Property / cites work: m-powers of simple sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditary sets and tabular reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Hypersimple Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of logical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semirecursive Sets and Positive Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships Between Reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees in Which the Recursive Sets are Uniformly Recursive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post's problem and his hypersimple set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degrees of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4127125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4186304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4181969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on universal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial segments of one-one degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial Segments of Many-One Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution to a Problem of Spector / rank
 
Normal rank
Property / cites work
 
Property / cites work: w tt-Complete Sets are not Necessarily tt-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursively enumerable degree which will not split over all lesser ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Countable initial segments of the degrees of unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weak truth table degrees of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing degrees and many-one degrees of maximal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the congruence of the upper semilattices of recursively enumerable m- powers and tabular powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabular powers of maximal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: One class of partial sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel determinacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatizable theories with few axiomatizable extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective content of field theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Degrees of Hyperimmune Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Intermediate Reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the First Order Theory of the Arithmetical Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets of positive integers and their decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effectively extensible theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable and creative theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets and degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three theorems on the degrees of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Degrees of Index Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Degrees of Index Sets. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear orderings under one-one reducibility / rank
 
Normal rank

Revision as of 15:34, 13 June 2024

scientific article
Language Label Description Also known as
English
Strong reducibilities
scientific article

    Statements

    Strong reducibilities (English)
    0 references
    1981
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    survey
    0 references
    one-degrees
    0 references
    tt-reducibility
    0 references
    Post's problem
    0 references
    T-completeness
    0 references
    single degrees
    0 references
    m-degrees
    0 references
    elementary equivalence
    0 references
    undecidability
    0 references
    tt- degrees
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references