"Computational complexity of a statistical theoremhood testing procedure ..."

Ivan Kramosil (1981)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition @ kybernetika.cz (open access)
- export record
  dblp key:
  - journals/kybernetika/Kramosil81a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/kybernetika/Kramosil81a
Ivan Kramosil:
Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs. Kybernetika 17(5): 359-367 (1981)

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.