"Strong reducibility on hypersimple sets."

Thomas G. McLaughlin (1965)

> Home

Details and statistics

DOI: 10.1305/NDJFL/1093958262

access: closed

type: Journal Article

metadata version: 2020-05-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ndjfl/McLaughlin65
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ndjfl/McLaughlin65
Thomas G. McLaughlin:
Strong reducibility on hypersimple sets. Notre Dame J. Formal Log. 6(3): 229-234 (1965)

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.