"Higher complexity search problems for bounded arithmetic and a formalized ..."

Neil Thapen (2011)

> Home

Details and statistics

DOI: 10.1007/S00153-011-0240-0

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/aml/Thapen11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aml/Thapen11
Neil Thapen:
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem. Arch. Math. Log. 50(7-8): 665-680 (2011)

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.