"A Note on the Computational Complexity of the Pure Classical Implication ..."

Gunnar Stålmarck (1989)

> Home

Details and statistics

DOI: 10.1016/0020-0190(89)90086-0

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Stalmarck89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Stalmarck89
Gunnar Stålmarck:
A Note on the Computational Complexity of the Pure Classical Implication Calculus. Inf. Process. Lett. 31(6): 277-278 (1989)

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.