11 found
Order:
Disambiguations
Harry R. Lewis [13]Harry Ralph Lewis [1]
  1.  50
    Elements of the Theory of Computation.Harry R. Lewis & Christos H. Papadimitriou - 1984 - Journal of Symbolic Logic 49 (3):989-990.
    Direct download  
     
    Export citation  
     
    Bookmark   40 citations  
  2. Leibniz on Binary: The Invention of Computer Arithmetic.Lloyd Strickland & Harry R. Lewis - 2022 - Cambridge, MA, USA: The MIT Press.
    The first collection of Leibniz's key writings on the binary system, newly translated, with many previously unpublished in any language. -/- The polymath Gottfried Wilhelm Leibniz (1646–1716) is known for his independent invention of the calculus in 1675. Another major—although less studied—mathematical contribution by Leibniz is his invention of binary arithmetic, the representational basis for today's digital computing. This book offers the first collection of Leibniz's most important writings on the binary system, all newly translated by the authors with many (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  35
    Unsolvable classes of quantificational formulas.Harry R. Lewis - 1979 - Reading, Mass.: Addison-Wesley.
  4.  53
    The word problem for cancellation semigroups with zero.Yuri Gurevich & Harry R. Lewis - 1984 - Journal of Symbolic Logic 49 (1):184-191.
    By theword problemfor some class of algebraic structures we mean the problem of determining, given a finite setEof equations between words and an additional equationx=y, whetherx=ymust hold in all structures satisfying each member ofE. In 1947 Post [P] showed the word problem for semigroups to be undecidable. This result was strengthened in 1950 by Turing, who showed the word problem to be undecidable forcancellation semigroups,i.e. semigroups satisfying thecancellation propertyNovikov [N] eventually showed the word problem for groups to be undecidable.In 1966 (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  5.  86
    Conservative reduction classes of Krom formulas.Stål O. Aanderaa, Egon Börger & Harry R. Lewis - 1982 - 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 (7 more)  
     
    Export citation  
     
    Bookmark  
  6.  57
    Linear sampling and the ∀∃∀ case of the decision problem.Stal O. Aanderaa & Harry R. Lewis - 1974 - Journal of Symbolic Logic 39 (3):519-548.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  68
    Prefix classes of Krom formulas.Stål O. Aanderaa & Harry R. Lewis - 1973 - Journal of Symbolic Logic 38 (4):628-642.
  8.  57
    Skolem reduction classes.Warren D. Goldfarb & Harry R. Lewis - 1975 - Journal of Symbolic Logic 40 (1):62-68.
  9.  61
    Krom formulas with one dyadic predicate letter.Harry R. Lewis - 1976 - Journal of Symbolic Logic 41 (2):341-362.
  10.  53
    The decision problem for formulas with a small number of atomic subformulas.Harry R. Lewis & Warren D. Goldfarb - 1973 - Journal of Symbolic Logic 38 (3):471-480.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11.  29
    (1 other version)ΠGarey Michael R. and Johnson David S.. Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco 1979, x + 338 pp. [REVIEW]Harry R. Lewis - 1983 - Journal of Symbolic Logic 48 (2):498-500.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark