THEOREM-PROVING VIA GENERAL MATINGS

[1] ANDREWS PB, 1976, IEEE T COMPUT, V25, P801, DOI 10.1109/TC.1976.1674698

[2] ANDREWS PB, 1977, 5TH P INT JOINT C AR, P566

[3] Bibel W., 1979, Theoretical Computer Science, V8, P31, DOI 10.1016/0304-3975(79)90054-9

[4] APPROACH TO A SYSTEMATIC THEOREM PROVING PROCEDURE IN FIRST-ORDER LOGIC [J]. COMPUTING, 1974, 12 (01) : 43 - 55

[5] BIBEL W, 1975, 1975 P INT COMP S, P205

[6] BIBEL W, 1980, LECTURE NOTES COMPUT, V88, P154

[7] BIBEL W, UNPUBLISHED

[8] BIBEL W, 1978, LECTURE NOTES COMPUT, V48, P215

[9] BIBEL W, 1980, P AISB 80 C, P11

[10] Church A., 1940, J SYMBOLIC LOGIC, V5, P56, DOI 10.2307/2266170

[1] ANDREWS PB, 1976, IEEE T COMPUT, V25, P801, DOI 10.1109/TC.1976.1674698

[2] ANDREWS PB, 1977, 5TH P INT JOINT C AR, P566

[3] Bibel W., 1979, Theoretical Computer Science, V8, P31, DOI 10.1016/0304-3975(79)90054-9

[4] APPROACH TO A SYSTEMATIC THEOREM PROVING PROCEDURE IN FIRST-ORDER LOGIC [J]. COMPUTING, 1974, 12 (01) : 43 - 55

[5] BIBEL W, 1975, 1975 P INT COMP S, P205

[6] BIBEL W, 1980, LECTURE NOTES COMPUT, V88, P154

[7] BIBEL W, UNPUBLISHED

[8] BIBEL W, 1978, LECTURE NOTES COMPUT, V48, P215

[9] BIBEL W, 1980, P AISB 80 C, P11

[10] Church A., 1940, J SYMBOLIC LOGIC, V5, P56, DOI 10.2307/2266170