![]() | ![]() |
1991 | ||
---|---|---|
9 | Samuel R. Buss, Louise Hay: On Truth-Table Reducibility to SAT Inf. Comput. 91(1): 86-102 (1991) | |
1986 | ||
8 | Andreas Blass, Louise Hay, Peter G. Hinman: Meeting of the Association for Symbolic Logic: Chicago, 1985. J. Symb. Log. 51(2): 507-510 (1986) | |
1982 | ||
7 | Louise Hay: On the Recursion-Theoretic Complexity of Relative Succinctness of Representations of Languages Information and Control 52(1): 2-7 (1982) | |
6 | Louise Hay, Douglas Miller: A Topological Analog to the Rice-Shapiro Index Theorem. J. Symb. Log. 47(4): 824-832 (1982) | |
1976 | ||
5 | Louise Hay: Boolean Combinations of R.E. Open Sets. J. Symb. Log. 41(1): 235-238 (1976) | |
1974 | ||
4 | Louise Hay: A Noninitial Segment of Index Sets. J. Symb. Log. 39(2): 209-224 (1974) | |
1972 | ||
3 | Louise Hay: A Discrete Chain of Degrees of Index Sets. J. Symb. Log. 37(1): 139-149 (1972) | |
2 | Louise Hay: A Note on Frame Extensions. J. Symb. Log. 37(3): 543-545 (1972) | |
1969 | ||
1 | Louise Hay: Index Sets of Finite Classes of Recursively Enumerable Sets. J. Symb. Log. 34(1): 39-44 (1969) |
1 | Andreas Blass | [8] |
2 | Samuel R. Buss | [9] |
3 | Peter G. Hinman | [8] |
4 | Douglas Miller | [6] |