"The Complexity of Propositional Proofs."

Nathan Segerlind (2007)

> Home

Details and statistics

DOI: 10.2178/BSL/1203350879

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/Segerlind07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bsl/Segerlind07
Nathan Segerlind:
The Complexity of Propositional Proofs. Bull. Symb. Log. 13(4): 417-481 (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.