default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLouise Hay
Person information
- affiliation: University of Illinois at Chicago, Department of Mathematics, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1991
[j14]Samuel R. Buss, Louise Hay:
On Truth-Table Reducibility to SAT. Inf. Comput. 91(1): 86-102 (1991)
1980 – 1989
- 1989
- [j13]Richard Beigel, William I. Gasarch, Louise Hay:
Bounded query classes and the difference hierarchy. Arch. Math. Log. 29(2): 69-84 (1989) - 1988
- [c2]Samuel R. Buss, Louise Hay:
On truth-table reducibility to SAT and the difference hierarchy over NP. SCT 1988: 224-233 - 1986
- [j12]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
- [j11]Louise Hay:
On the Recursion-Theoretic Complexity of Relative Succinctness of Representations of Languages. Inf. Control. 52(1): 2-7 (1982) - [j10]Louise Hay, Douglas Miller:
A Topological Analog to the Rice-Shapiro Index Theorem. J. Symb. Log. 47(4): 824-832 (1982)
1970 – 1979
- 1979
- [j9]Louise Hay, Nancy Johnson:
Extensional Characterization of Index Sets. Math. Log. Q. 25(13-18): 227-234 (1979) - [c1]Louise Hay, Richard Larson:
ZLISP: A lisp for a Micro-computer. COMPSAC 1979: 629-630 - 1978
- [j8]Louise Hay:
Convex subsets of 2n and bounded truth-table reducibility. Discret. Math. 21(1): 31-46 (1978) - 1976
- [j7]Louise Hay:
Boolean Combinations of R.E. Open Sets. J. Symb. Log. 41(1): 235-238 (1976) - 1975
- [j6]Louise Hay:
Spectra and halting problems. Math. Log. Q. 21(1): 167-176 (1975) - 1974
- [j5]Louise Hay:
A Noninitial Segment of Index Sets. J. Symb. Log. 39(2): 209-224 (1974) - 1972
- [j4]Louise Hay:
A Discrete Chain of Degrees of Index Sets. J. Symb. Log. 37(1): 139-149 (1972) - [j3]Louise Hay:
A Note on Frame Extensions. J. Symb. Log. 37(3): 543-545 (1972)
1960 – 1969
- 1969
- [j2]Louise Hay:
Index Sets of Finite Classes of Recursively Enumerable Sets. J. Symb. Log. 34(1): 39-44 (1969) - 1963
- [j1]Louise Schmir Hay:
Axiomatization of the Infinite-Valued Predicate Calculus. J. Symb. Log. 28(1): 77-86 (1963)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
