Lupanov O. B.. O vozmožnostáh sintéza shém iz raznoobraznyh eléméntov. Doklady Akadémii Nauk SSSR, vol. 103 (1955), pp. 561–563.Lupanov O. B.. On the possibilities of designing circuits out of various elements. English translation of the preceding. Multilith-offset. Morris D. Friedman, Inc., Needham Heights, Mass., c. 1957, 5 pp.Lupanov O. B.. O sintézè kontaktnyh shém. Doklady Akadémii Nauk SSSR, vol. 119 (1958), pp. 23–26.Lupanov O. B.. On the synthesis of contact circuits. English translation of the preceding. Multilith-offset. Morris D. Friedman, Inc., Needham Heights, Mass., 1958, 5 pp.Lupanov O. B.. On the synthesis of contact networks. English translation of the same. Automation express, vol. 1 no. 3 (1958), pp. 7–8.Moore, Edward F. · The Journal of Symbolic Logic · 1959

Logical Design of Digital Computersby Montgomery Phister,Review by: Edward F. Moore · The Journal of Symbolic Logic · 1958

Analysis of Bilateral Iterative Networksby Frederick C. HennieReview by: Edward F. Moore · The Journal of Symbolic Logic · 1959

Switching Circuits and Logical Designby Samuel H. CaldwellReview by: Edward F. Moore · The Journal of Symbolic Logic · 1958

Complexity in Electronic Switching Circuitsby David E. MullerReview by: Edward F. Moore · The Journal of Symbolic Logic · 1960

The Hastings Bible DictionaryReview by: George F. Moore, Edward L. Curtis, Charles Foster Kent, Lewis B. Paton, Sylvester Burnham, G. S. Goodspeed, J. H. Breasted, Shailer Mathews, C. W. Votaw, J. E. Frame, Marvin R. Vincent, George A. Barton and E. P. Gould · The American Journal of Theology · 1899

On the Synthesis of Switching Circuits with Selector Switchesby V. M. OstianuReview by: Edward F. Moore · The Journal of Symbolic Logic · 1959

A Note on Contact Networks for Switching Functions of Four Variablesby Roderick GouldReview by: Edward F. Moore · The Journal of Symbolic Logic · 1959

The Design and Use of Hazard-Free Switching Networksby David A. HuffmanReview by: Edward F. Moore · The Journal of Symbolic Logic · 1960

Computability and λ-DefinabilityA. M. Turing · The Journal of Symbolic Logic · 1937

Definability and Decision Problems in ArithmeticJulia Robinson · The Journal of Symbolic Logic · 1949

Arithmetical Problems and Recursively Enumerable PredicatesMartin Davis · The Journal of Symbolic Logic · 1953

The Interpretability Logic of Peano ArithmeticAlessandro Berarducci · The Journal of Symbolic Logic · 1990

Steps Toward a Constructive NominalismNelson Goodman and W. V. Quine · The Journal of Symbolic Logic · 1947

A Completeness Theorem in Modal LogicSaul A. Kripke · The Journal of Symbolic Logic · 1959

Models and RealityHilary Putnam · The Journal of Symbolic Logic · 1980

A Theory of Restricted Quantification ITheodore Hailperin · The Journal of Symbolic Logic · 1957