Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
gptkb:Peano_arithmetic
formal systems |
| gptkbp:field |
gptkb:logic
|
| https://www.w3.org/2000/01/rdf-schema#label |
Rosser's theorem
|
| gptkbp:namedAfter |
gptkb:J._Barkley_Rosser
|
| gptkbp:powers |
gptkb:Gödel's_first_incompleteness_theorem
|
| gptkbp:publishedIn |
gptkb:Journal_of_Symbolic_Logic
|
| gptkbp:relatedTo |
gptkb:Gödel's_incompleteness_theorems
|
| gptkbp:sentence |
If a formal system is consistent and effectively generated, then there exists a statement that is undecidable in the system, even without assuming ω-consistency.
|
| gptkbp:yearProposed |
1936
|
| gptkbp:bfsParent |
gptkb:Barkley_Rosser
gptkb:J._Barkley_Rosser |
| gptkbp:bfsLayer |
5
|