"Complexity for probability logic with quantifiers over propositions."

Stanislav O. Speranski (2013)

> Home

Details and statistics

DOI: 10.1093/LOGCOM/EXS041

access: closed

type: Journal Article

metadata version: 2017-06-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/logcom/Speranski13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/logcom/Speranski13
Stanislav O. Speranski:
Complexity for probability logic with quantifiers over propositions. J. Log. Comput. 23(5): 1035-1055 (2013)

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.