Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
gptkb:first-order_logic
|
| gptkbp:field |
gptkb:logic
automated theorem proving |
| https://www.w3.org/2000/01/rdf-schema#label |
Herbrand's theorem
|
| gptkbp:influenced |
resolution principle
automated deduction |
| gptkbp:namedAfter |
gptkb:Jacques_Herbrand
|
| gptkbp:relatedTo |
gptkb:Herbrand_base
gptkb:Herbrand_interpretation gptkb:Herbrand_universe |
| gptkbp:state |
A first-order formula is provable if and only if a finite disjunction of its ground instances is propositionally valid
|
| gptkbp:usedIn |
proof theory
automated reasoning |
| gptkbp:yearProposed |
1930
|
| gptkbp:bfsParent |
gptkb:Jacques_Herbrand
|
| gptkbp:bfsLayer |
6
|