Rosser's improvement of Gödel's incompleteness theorem
GPTKB entity
Statements (13)
Predicate | Object |
---|---|
gptkbp:instanceOf |
gptkb:mathematical_concept
|
gptkbp:author |
gptkb:J._Barkley_Rosser
|
gptkbp:contribution |
removes the need for ω-consistency in Gödel's original proof
|
gptkbp:field |
gptkb:logic
|
https://www.w3.org/2000/01/rdf-schema#label |
Rosser's improvement of Gödel's incompleteness theorem
|
gptkbp:improves |
gptkb:Gödel's_first_incompleteness_theorem
|
gptkbp:publicationYear |
1936
|
gptkbp:publishedIn |
gptkb:Journal_of_Symbolic_Logic
|
gptkbp:relatedTo |
gptkb:Peano_arithmetic
recursion theory |
gptkbp:result |
If a formal system is consistent and effectively generated, then it is incomplete
|
gptkbp:bfsParent |
gptkb:Rosser's_trick
|
gptkbp:bfsLayer |
6
|