Undecidability vs transfinite induction for the consistency of hyperarithmetical sets (Q3956932)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Undecidability vs transfinite induction for the consistency of hyperarithmetical sets |
scientific article |
Statements
Undecidability vs transfinite induction for the consistency of hyperarithmetical sets (English)
0 references
1982
0 references
semiformal system for description of hyperarithmetic computability
0 references
0 references
