Switch to: Citations

Add references

You must login to add references.
  1. A uniform method for proving lower bounds on the computational complexity of logical theories.Kevin J. Compton & C. Ward Henson - 1990 - Annals of Pure and Applied Logic 48 (1):1.
    A new method for obtaining lower bounds on the computational complexity of logical theories is presented. It extends widely used techniques for proving the undecidability of theories by interpreting models of a theory already known to be undecidable. New inseparability results related to the well known inseparability result of Trakhtenbrot and Vaught are the foundation of the method. Their use yields hereditary lower bounds . By means of interpretations lower bounds can be transferred from one theory to another. Complicated machine (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Entscheidungsproblem Reduced to the ∀∃∀ Case.A. S. Kahr, Edward F. Moore & Hao Wang - 1962 - Journal of Symbolic Logic 27 (2):225-225.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The decision problem for standard classes.Yuri Gurevich - 1976 - Journal of Symbolic Logic 41 (2):460-464.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • (1 other version)On direct products of theories.Andrzej Mostowski - 1952 - Journal of Symbolic Logic 17 (1):1-31.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • The computational complexity of logical theories.Jeanne Ferrante - 1979 - New York: Springer Verlag. Edited by Charles W. Rackoff.
    This book asks not only how the study of white-collar crime can enrich our understanding of crime and justice more generally, but also how criminological ...
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • The First Order Properties of Products of Algebraic Systems.S. Feferman & R. L. Vaught - 1967 - Journal of Symbolic Logic 32 (2):276-276.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • Undecidability of the Domino Problem.Robert Berger - 1966 - American Mathematical Soc..
    Download  
     
    Export citation  
     
    Bookmark   12 citations