12 found
Order:
  1. Harry R. Lewis & Christos H. Papadimitriou (1984). Elements of the Theory of Computation. Journal of Symbolic Logic 49 (3):989-990.
    Direct download  
     
    Export citation  
     
    My bibliography   13 citations  
  2.  4
    Harry R. Lewis (1979). Unsolvable Classes of Quantificational Formulas. Addison-Wesley Pub. Co..
    Direct download  
     
    Export citation  
     
    My bibliography   9 citations  
  3. Stal O. Aanderaa & Harry R. Lewis (1974). Linear Sampling and the |Forall |Exists |Forall Case of the Decision Problem. Journal of Symbolic Logic 39 (3):519 - 548.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  4.  12
    Harry R. Lewis & Warren D. Goldfarb (1973). The Decision Problem for Formulas with a Small Number of Atomic Subformulas. Journal of Symbolic Logic 38 (3):471-480.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  5.  4
    Yuri Gurevich & Harry R. Lewis (1984). The Word Problem for Cancellation Semigroups with Zero. Journal of Symbolic Logic 49 (1):184-191.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  6.  16
    Stål O. Aanderaa, Egon Börger & Harry R. Lewis (1982). Conservative Reduction Classes of Krom Formulas. Journal of Symbolic Logic 47 (1):110-130.
    A Krom formula of pure quantification theory is a formula in conjunctive normal form such that each conjunct is a disjunction of at most two atomic formulas or negations of atomic formulas. Every class of Krom formulas that is determined by the form of their quantifier prefixes and which is known to have an unsolvable decision problem for satisfiability is here shown to be a conservative reduction class. Therefore both the general satisfiability problem, and the problem of satisfiability in finite (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  7.  12
    Stål O. Aanderaa & Harry R. Lewis (1973). Prefix Classes of Krom Formulas. Journal of Symbolic Logic 38 (4):628-642.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  8.  2
    Harry R. Lewis (1976). Krom Formulas with One Dyadic Predicate Letter. Journal of Symbolic Logic 41 (2):341-362.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  9.  2
    Harry R. Lewis & Warren D. Goldfarb (1975). Skolem Reduction Classes. Journal of Symbolic Logic 40 (March):62-68.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  10.  8
    Warren D. Goldfarb & Harry R. Lewis (1975). Skolem Reduction Classes. Journal of Symbolic Logic 40 (1):62-68.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  11. Harry R. Lewis & Christos H. Papadimitriou (1998). Elements of the Theory of Computation Harry R. Lewis, Christos H. Papadimitriou.
     
    Export citation  
     
    My bibliography  
  12. Harry R. Lewis (1983). Review: Michael R. Garey, David S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness. [REVIEW] Journal of Symbolic Logic 48 (2):498-500.
     
    Export citation  
     
    My bibliography