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. |
Year | DOI | Venue |
---|---|---|
1991 | 10.1016/0304-3975(91)90307-N | Theor. Comput. Sci. |
Keywords | DocType | Volume |
rapid construction,algebraic axiom | Journal | 90 |
Issue | ISSN | Citations |
1 | Theoretical Computer Science | 11 |
PageRank | References | Authors |
1.44 | 0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
J. M. Barzdin | 1 | 65 | 14.83 |
G. J. Barzdin | 2 | 11 | 1.44 |