6 found
Order:
  1.  17
    An Undecidable Problem in Finite Combinatorics.Kevin J. Compton - 1984 - Journal of Symbolic Logic 49 (3):842-850.
  2. Review: Jon Barwise, John Etchemendy, The Language of First-Order Logic, Including the Program Tarski's World; Jon Barwise, John Etchemendy, The Language of First-Order Logic, Including the Macintosh Program Tarski's World. [REVIEW]Kevin J. Compton - 1993 - Journal of Symbolic Logic 58 (1):362-363.
  3.  21
    Barwise Jon and Etchemendy John. The Language of First-Order Logic, Including the Program Tarski's World. Includes Version 3.0 of LV 370 (2). CSLI Lecture Notes, No. 23. Center for the Study of Language and Information, Stanford 1990, Also Distributed by the University of Chicago Press, Chicago, Xiii+ 259 Pp.+ Disk. Barwise Jon and Etchemendy John. The Language of First-Order Logic, Including the Macintosh Program Tarski's World. Of the Preceding. CSLI Lecture Notes, No. 23. Center for the Study of .. [REVIEW]Kevin J. Compton - 1993 - Journal of Symbolic Logic 58 (1):362-363.
  4.  5
    Some Useful Preservation Theorems.Kevin J. Compton - 1983 - Journal of Symbolic Logic 48 (2):427-440.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  5.  15
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  6.  7
    Nonconvergence, Undecidability, and Intractability in Asymptotic Problems.Kevin J. Compton, C. Ward Henson & Saharon Shelah - 1987 - Annals of Pure and Applied Logic 36 (3):207.