"Computational complexity of logical theories of one successor and another ..."

Pascal Michel (2007)

> Home

Details and statistics

DOI: 10.1007/S00153-006-0031-1

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/Michel07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aml/Michel07
Pascal Michel:
Computational complexity of logical theories of one successor and another unary function. Arch. Math. Log. 46(2): 123-148 (2007)

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.