1 citations · 1 across the 6 of their papers we have counts for
6 papers
On Godel's treatment of the undecidable in 1931
Paola Cattabriga
In this article we discuss the proof in the short unpublished paper appeared in the 3rd volume of Godel's Collected Works entitled "On undecidable sentences" (*1931?), which provid…
A note reviewing Turing's 1936
Paola Cattabriga
By closely rereading the original Turing's 1936 article, we can gain insight about that it is based on the claim to have defined a number which is not computable, arguing that ther…
How to release Frege's system from Russell's antinomy
Paola Cattabriga
The conditions for proper definitions in mathematics are given, in terms of the theory of definition, on the basis of the criterions of eliminability and non-creativity. As a defin…
Beyond Undecidable
Paola Cattabriga
The predicate complementary to the well-known Godel's provability predicate is defined. From its recursiveness new consequences concerning the incompleteness argumentation are draw…
Beyond Uncountable
Paola Cattabriga
In 1891 Cantor presented two proofs with the purpose to establish a general theorem that any set can be replaced by a set of greater power. Cantor's power set theorem can be consid…
Observations concerning Gödel's 1931
Paola Cattabriga
This article demonstrates the invalidity of Theorem VI of Godel's monograph of 1931, showing that propositions (15) and (16), derived from definition (8.1), in its proof, are false…