The theory of the polynomial many-one degrees of recursive sets is undecidable (Q5096783): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3337458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublattices of the polynomial time degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inhomogeneity in the Structure of Karp Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3778006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of the recursively enumerable weak truth-table degrees is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Honest polynomial time reducibilities and the \(P=?NP\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability and Boolean representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of the honest polynomial m-degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3665086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3734391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / 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: On the structure of sets in NP and other complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial and abstract subrecursive classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of the PTIME degrees of the recursive sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory / rank
 
Normal rank

Latest revision as of 22:43, 29 July 2024

scientific article; zbMATH DE number 7573032
Language Label Description Also known as
English
The theory of the polynomial many-one degrees of recursive sets is undecidable
scientific article; zbMATH DE number 7573032

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references