Reconciling transparency, low <i>Δ</i>0-complexity and axiomatic weakness in undecidability proofs (Q6162116)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reconciling transparency, low Δ0-complexity and axiomatic weakness in undecidability proofs |
scientific article; zbMATH DE number 7696222
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reconciling transparency, low <i>Δ</i>0-complexity and axiomatic weakness in undecidability proofs |
scientific article; zbMATH DE number 7696222 |
Statements
Reconciling transparency, low <i>Δ</i>0-complexity and axiomatic weakness in undecidability proofs (English)
0 references
15 June 2023
0 references
weak set theories
0 references
Gödel incompleteness
0 references
essential undecidability
0 references
