Axiomatization of the Infinite-Valued Predicate Calculus. - Louise Schmir Hay (J. Symb. Log., 1963)

Index Sets of Finite Classes of Recursively Enumerable Sets. - Louise Hay (J. Symb. Log., 1969)

A Discrete Chain of Degrees of Index Sets. - Louise Hay (J. Symb. Log., 1972)

A Note on Frame Extensions. - Louise Hay (J. Symb. Log., 1972)

A Noninitial Segment of Index Sets. - Louise Hay (J. Symb. Log., 1974)

Spectra and halting problems. - Louise Hay (Math. Log. Q., 1975)

Boolean Combinations of R.E. Open Sets. - Louise Hay (J. Symb. Log., 1976)

Convex subsets of 2n and bounded truth-table reducibility. - Louise Hay (Discret. Math., 1978)

ZLISP: A lisp for a Micro-computer. - Louise Hay; Richard Larson (COMPSAC, 1979)

Extensional Characterization of Index Sets. - Louise Hay; Nancy Johnson (Math. Log. Q., 1979)

A Topological Analog to the Rice-Shapiro Index Theorem. - Louise Hay; Douglas Miller (J. Symb. Log., 1982)

On the Recursion-Theoretic Complexity of Relative Succinctness of Representations of Languages - Louise Hay (Inf. Control., 1982)

Meeting of the Association for Symbolic Logic: Chicago, 1985. - Andreas Blass; Louise Hay; Peter G. Hinman (J. Symb. Log., 1986)

On truth-table reducibility to SAT and the difference hierarchy over NP. - Samuel R. Buss; Louise Hay (SCT, 1988)

Bounded query classes and the difference hierarchy. - Richard Beigel; William I. Gasarch; Louise Hay (Arch. Math. Log., 1989)

On Truth-Table Reducibility to SAT - Samuel R. Buss; Louise Hay (Inf. Comput., 1991)