A case study in automated theorem proving: Finding sages in combinatory logic (Q1098333)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A case study in automated theorem proving: Finding sages in combinatory logic |
scientific article; zbMATH DE number 4037274
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A case study in automated theorem proving: Finding sages in combinatory logic |
scientific article; zbMATH DE number 4037274 |
Statements
A case study in automated theorem proving: Finding sages in combinatory logic (English)
0 references
1987
0 references
The paper presents an application of automated theorem proving to a study of a strong fixed-point property in a system with the B and W combinators. During the study, besides the one previously known solution (due to R. Statman), four new have been found. The paper contains a very detailed discussion of the uses of the two automated theorem proving programs, which assisted during the study. For related discussion, cf. also the following review.
0 references
automated reasoning
0 references
paramodulation
0 references
demodulation
0 references
proof checking
0 references
bidirectional search
0 references
combinatory logic
0 references
ITP
0 references
automated theorem proving
0 references
fixed-point property
0 references
0.9300748
0 references
0.8951521
0 references
0.8863327
0 references
0.87885123
0 references
