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 the normal view instead:
scientific article; zbMATH DE number 753927
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7108568549156189
0 references
0.7102842926979065
0 references
0.7084380388259888
0 references
0.6978398561477661
0 references
0.6939145922660828
0 references
