Shoenfield's completeness theorem
GPTKB entity
Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
gptkb:first-order_logic
recursively enumerable theories |
| gptkbp:field |
gptkb:logic
|
| gptkbp:namedAfter |
gptkb:Joseph_R._Shoenfield
|
| gptkbp:publishedIn |
Mathematical Logic (book, 1967)
|
| gptkbp:relatedTo |
gptkb:Gödel's_completeness_theorem
recursion theory decidability |
| gptkbp:state |
Every recursively enumerable theory that is complete is decidable
|
| gptkbp:bfsParent |
gptkb:Joseph_R._Shoenfield
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Shoenfield's completeness theorem
|