Peano's smart children: A provability logical study of systems with built-in consistency (Q1262309): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1305/ndjfl/1093635077 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2086963079 / rank | |||
Revision as of 11:27, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Peano's smart children: A provability logical study of systems with built-in consistency |
scientific article |
Statements
Peano's smart children: A provability logical study of systems with built-in consistency (English)
0 references
1989
0 references
This very interesting paper studies several arithmetic systems with built-in consistency intended to escape the dire consequences of Gödel's second incompleteness theorem. One key notion is that of provably extensional self-reference by means of which the systems can prove their own consistency. The study adds further light and new questions to the relations between Gödel's two incompleteness theorems, as well as to the theory of bimodal systems.
0 references
arithmetic systems with built-in consistency
0 references
provably extensional self- reference
0 references
bimodal systems
0 references
