Abstract
A strategy is contrived, employing the language of finite-order predicate calculus, for finding proofs of theorems. A theorem is formulated, based on 2 known theorems on purity and absorption, and used to determine 5 properties of a set of propositions. 3 references.
Citation Formats
Lovitskii, V A, and Barenboim, M S.
Search strategy for theorem proving in artificial systems. I.
USSR: N. p.,
1981.
Web.
Lovitskii, V A, & Barenboim, M S.
Search strategy for theorem proving in artificial systems. I.
USSR.
Lovitskii, V A, and Barenboim, M S.
1981.
"Search strategy for theorem proving in artificial systems. I."
USSR.
@misc{etde_5000073,
title = {Search strategy for theorem proving in artificial systems. I}
author = {Lovitskii, V A, and Barenboim, M S}
abstractNote = {A strategy is contrived, employing the language of finite-order predicate calculus, for finding proofs of theorems. A theorem is formulated, based on 2 known theorems on purity and absorption, and used to determine 5 properties of a set of propositions. 3 references.}
journal = []
volume = {27}
journal type = {AC}
place = {USSR}
year = {1981}
month = {Jan}
}
title = {Search strategy for theorem proving in artificial systems. I}
author = {Lovitskii, V A, and Barenboim, M S}
abstractNote = {A strategy is contrived, employing the language of finite-order predicate calculus, for finding proofs of theorems. A theorem is formulated, based on 2 known theorems on purity and absorption, and used to determine 5 properties of a set of propositions. 3 references.}
journal = []
volume = {27}
journal type = {AC}
place = {USSR}
year = {1981}
month = {Jan}
}