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.

2010

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

2004

First, we study a question we encountered while exploring order-types of models of arithmetic. We prove that if M PA is…

2002

Any (1-)consistent and sufficiently strong system of first-order formal arithmetic fails to decide some independent Godel…

2000

Abstract In view of the importance of nucleoside analogs as enzyme inhibitors and adenosine receptor (ant)agonists, new adenosine…

1991

1988

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

1978

Restricted classes of programming systems (Godel numberings) are studied, where a programming system is in a given class if every…

1976

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

1975

1972