Is independence an exception?

DOI10.1016/0096-3003(94)90158-9MaRDI QIDQ1805264zbMATH OpenOpenAlexWikidataFDO

Authors Cristian S. Calude, Helmut Jürgensen, Marius Zimand

Publication date 11 May 1995

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0096-3003(94)90158-9

zbMATH Keywords

arithmetical theorydensityrecursive enumerabilitytopologyunderivable sentence

Mathematics Subject Classification ID

Computability and recursion theory (03D99) Proof theory in general (including proof-theoretic semantics) (03F03) First-order arithmetic and fragments (03F30)

Review text

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.

Recommendations

• How to prove representation-independent independence results
• Generic incompleteness of formal arithmetic
• Generic Gödel's incompleteness theorem
• Arithmetical independence results using higher recursion theory
• Definability of the set of all true propositions of arithmetic by passage to the limit

Cites work

• Does Gödel's Theorem Matter to Mathematics?
• Effectivizing Inseparability
• scientific article; zbMATH DE number 3817693 (Why is no real title available?)
• scientific article; zbMATH DE number 3922637 (Why is no real title available?)
• scientific article; zbMATH DE number 44959 (Why is no real title available?)
• scientific article; zbMATH DE number 50943 (Why is no real title available?)
• scientific article; zbMATH DE number 53543 (Why is no real title available?)
• scientific article; zbMATH DE number 610563 (Why is no real title available?)
• scientific article; zbMATH DE number 3253716 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Information-theoretic incompleteness
• Relations on free monoids, their independent sets, and codes¹
• Theories of computational complexity
• Undecidability and incompleteness in classical mechanics

Cited in

(8)

• Topology on words
• The solution of the \(n\)-body problem
• Is complexity a source of incompleteness?
• Invariance and Universality of Complexity
• Some transfinite generalisations of Gödel's incompleteness theorem
• Effective category and measure in abstract complexity theory
• Equilibration of a dissipative quantum oscillator
• Effective category and measure in abstract complexity theory

This page was built for publication: Is independence an exception?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1805264)