"Computing k-Trivial Sets by Incomplete Random Sets."

Laurent Bienvenu et al. (2014)

> Home

Details and statistics

DOI: 10.1017/BSL.2013.3

access: closed

type: Journal Article

metadata version: 2020-07-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/bsl/BienvenuDG0MNT14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bsl/BienvenuDG0MNT14
Laurent Bienvenu, Adam R. Day, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Dan Turetsky:
Computing k-Trivial Sets by Incomplete Random Sets. Bull. Symb. Log. 20(1): 80-90 (2014)

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.