"Completeness Proofs for Propositional Logic with Polynomial-Time Connectives."

John N. Crossley, Philip J. Scott (1989)

> Home

Details and statistics

DOI: 10.1016/0168-0072(89)90044-4

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/apal/CrossleyS89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/apal/CrossleyS89
John N. Crossley, Philip J. Scott:
Completeness Proofs for Propositional Logic with Polynomial-Time Connectives. Ann. Pure Appl. Log. 44(1-2): 39-52 (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.