Switch to: Citations

Add references

You must login to add references.
  1. The one-one equivalence of some general combinatorial decision problems.Charles E. Hughes & W. E. Singletary - 1977 - Notre Dame Journal of Formal Logic 18 (2):305-309.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Download  
     
    Export citation  
     
    Bookmark   596 citations  
  • Formal Reductions of the General Combinatorial Decision Problem.Emil L. Post - 1943 - Journal of Symbolic Logic 8 (1):50-52.
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Many-one degrees associated with partial propositional calculi.W. E. Singletary - 1974 - Notre Dame Journal of Formal Logic 15 (2):335-343.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)The Post-Lineal theorems for arbitrary recursively enumerable degrees of unsolvability.Ann H. Ihrig - 1965 - Notre Dame Journal of Formal Logic 6 (1):54-72.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Combinatorial systems with axiom.C. E. Hughes & W. E. Singletary - 1973 - Notre Dame Journal of Formal Logic 14 (3):354-360.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)A detailed argument for the Post-Linial theorems.Mary Katherine Yntema - 1964 - Notre Dame Journal of Formal Logic 5 (1):37-50.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
    Download  
     
    Export citation  
     
    Bookmark   480 citations  
  • A Variant of a Recursively Unsolvable Problem.Emil L. Post - 1947 - Journal of Symbolic Logic 12 (2):55-56.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Some Ways of Constructing a Propositional Calculus of any Required Degree of Unsolvability.M. D. Gladstone - 1969 - Journal of Symbolic Logic 34 (3):505-506.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Combinatorial systems with axiom.C. E. Hughes - 1973 - Notre Dame Journal of Formal Logic 14:354.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)The post correspondence problem.Dennis F. Cudia & Wilson E. Singletary - 1968 - Journal of Symbolic Logic 33 (3):418-430.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-fd59bd6bd-cklpr uwo