Information and Computing Sciences
simple theorem
This paper presents some experiments using an automated theorem proving program (ATP) to prove theorems in nonassociative ring theory of varying difficulty. Several simple theorems proved by the program are discussed and other more difficult theorems that have been attempted are presented with some commentary as to why the program failed to find certain proofs. We also give some open problems that might be suitable for investigation with an ATP.
ring theory
ATP
investigation
en
theorem proving programs
problem
theory
https://doi.org/10.1007/bf00243209
difficult theorems
proof
difficulties
experiments
open problem
1987-06-01
paper
theorem
articles
Some experiments in nonassociative ring theory with an automated theorem prover
211-221
commentary
proving programs
https://scigraph.springernature.com/explorer/license/
program
false
certain proofs
2022-01-01T18:04
article
1987-06
nonassociative ring theory
Springer Nature
0168-7433
1573-0670
Journal of Automated Reasoning
Rick L.
Stevens
dimensions_id
pub.1032603112
3
Cognitive Sciences
Psychology and Cognitive Sciences
Argonne National Laboratory, 9700 South Cass Avenue, 60439, Argonne, IL, USA
Argonne National Laboratory, 9700 South Cass Avenue, 60439, Argonne, IL, USA
Artificial Intelligence and Image Processing
Springer Nature - SN SciGraph project
Computation Theory and Mathematics
2
10.1007/bf00243209
doi