"Complexity of Equivalence Relations and Preorders from Computability Theory."

Egor Ianovski et al. (2014)

> Home

Details and statistics

DOI: 10.1017/JSL.2013.33

access: closed

type: Journal Article

metadata version: 2022-11-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jsyml/IanovskiMNN14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsyml/IanovskiMNN14
Egor Ianovski, Russell G. Miller, Keng Meng Ng, André Nies:
Complexity of Equivalence Relations and Preorders from Computability Theory. J. Symb. Log. 79(3): 859-881 (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.