Gödel numbering

Known as: Godel set, Godel number, Gödel numbers

In mathematical logic, a Gödel numbering is a function that assigns to each symbol and well-formed formula of some formal language a unique natural…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

Abstract The prevalent interpretation of Gödel’s Second Theorem states that a sufficiently adequate and consistent theory does…

2010

Abstract Gödel's second incompleteness theorem is proved for Herbrand consistency of some arithmetical theories with bounded…

1991

1990

. This paper proves an inconsistency in ZFC. We show that under two assumptions – a strengthened form of the strong Goldbach…

1988

Many iterative algorithms for the solution of large linear systems may be effectively vectorized if the diagonal of the matrix is…

Highly Cited

1979

Highly Cited

1979

Solvable Classes of Quantificational Formulas Burton Dreben and Warren D. Goldfarb, Harvard Univ. Skolem and Herbrand addressed…

1976

For the first Gödel incompleteness theorem, the existence in a formal system of arithmetic L of a sentence which is neither…

1972

1964

In [3], Rogers discussed the concept of Godel numbering. He defined a semi-effective numbering, constructed a semi-lattice of…

Highly Cited

1962

Highly Cited

1962

Suppose the ri-placed relation symbols Pi, 1 ≦ i ≦ k, are all the non-logical constants occurring in the closed formula , also…