Abstract
An axiom is called reliable if it is confirmed in several places in a given sample of algebra. A very effective algorithm for enumerating such axioms is described.
| Original language | English |
|---|---|
| Pages (from-to) | 199-208 |
| Number of pages | 10 |
| Journal | Theoretical Computer Science |
| Volume | 90 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 11 Nov 1991 |
| Externally published | Yes |
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver