Is independence an exception? (Q1805264)
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: Is independence an exception? |
scientific article; zbMATH DE number 753927
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Is independence an exception? |
scientific article; zbMATH DE number 753927 |
Statements
Is independence an exception? (English)
0 references
11 May 1995
0 references
Several topological settings are given for the following fact and its refinements: If a set \(A\) definable in a language of a reasonable arithmetical theory \(T\) is not recursively enumerable, then there is a true sentence `\(n\in A\)' underivable in \(T\). Roughly speaking, the set of such an \(n\) is dense in a wide class of topologies.
0 references
recursive enumerability
0 references
underivable sentence
0 references
density
0 references
topology
0 references
arithmetical theory
0 references
