Three universal representations of recursively enumerable sets (Q3048819): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The decision problem for exponential diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explicit diophantine definition of the exponential function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbert's Tenth Problem is Unsolvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2773299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diophantine Representation of the Set of Prime Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5768440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some representations of Diophantine sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetical representation of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An unsolvable problem in number theory / rank
 
Normal rank

Latest revision as of 02:58, 13 June 2024

scientific article
Language Label Description Also known as
English
Three universal representations of recursively enumerable sets
scientific article

    Statements

    Three universal representations of recursively enumerable sets (English)
    0 references
    0 references
    0 references
    1978
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Hilbert's tenth problem
    0 references
    universal representation of recursively enumerable sets
    0 references
    decidability
    0 references
    arithmetical formulas
    0 references
    quantifier prefix
    0 references
    diophantine equations
    0 references
    0 references